Number of Unique Good Subsequences

Given a binary string s, return the number of unique good subsequences of s.

A good subsequence is a subsequence that has only characters '0' and '1' and has the same number of '0's and '1's.

Since the result may be very large, return it modulo 10^9 + 7.