Python (Simple DP)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def numberOfUniqueGoodSubsequences(self, binary):\n        total, count_zero, count_one, mod = 0, 0, 0, 10**9+7\n\n        for i in binary:\n            if i == "1":\n                count_one += count_zero + 1 \n            else:\n                count_zero += count_one\n\n        return (count_zero + count_one + ("0" in binary))%mod\n```
['Python3']