Python solution
\ndef numberOfUniqueGoodSubsequences(self, s: str) -> int:\n\td, mod = [0, 0], 10**9+7\n\tfor n in s:\n\t\td[int(n)] = sum(d)+(n==\'1\')\n\treturn (sum(d) + (\'
```\ndef numberOfUniqueGoodSubsequences(self, s: str) -> int:\n\td, mod = [0, 0], 10**9+7\n\tfor n in s:\n\t\td[int(n)] = sum(d)+(n==\'1\')\n\treturn (sum(d) + (\'0\'in s))%mod\n```
[]