1987. Number of Unique Good Subsequences: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1498,3 +1498,4 @@ mod s1982_find_array_given_subset_sums;
 mod s1984_minimum_difference_between_highest_and_lowest_of_k_scores;
 mod s1985_find_the_kth_largest_integer_in_the_array;
 mod s1986_minimum_number_of_work_sessions_to_finish_the_tasks;
+mod s1987_number_of_unique_good_subsequences;

src/solution/s1987_number_of_unique_good_subsequences.rs

@@ -0,0 +1,87 @@
+/**
+ * [1987] Number of Unique Good Subsequences
+ *
+ * You are given a binary string binary. A subsequence of binary is considered good if it is not empty and has no leading zeros (with the exception of "0").
+ * Find the number of unique good subsequences of binary.
+ *
+ * 	For example, if binary = "001", then all the good subsequences are ["0", "0", "1"], so the unique good subsequences are "0" and "1". Note that subsequences "00", "01", and "001" are not good because they have leading zeros.
+ *
+ * Return the number of unique good subsequences of binary. Since the answer may be very large, return it modulo 10^9 + 7.
+ * A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
+ *  
+ * Example 1:
+ *
+ * Input: binary = "001"
+ * Output: 2
+ * Explanation: The good subsequences of binary are ["0", "0", "1"].
+ * The unique good subsequences are "0" and "1".
+ *
+ * Example 2:
+ *
+ * Input: binary = "11"
+ * Output: 2
+ * Explanation: The good subsequences of binary are ["1", "1", "11"].
+ * The unique good subsequences are "1" and "11".
+ * Example 3:
+ *
+ * Input: binary = "101"
+ * Output: 5
+ * Explanation: The good subsequences of binary are ["1", "0", "1", "10", "11", "101"].
+ * The unique good subsequences are "0", "1", "10", "11", and "101".
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= binary.length <= 10^5
+ * 	binary consists of only '0's and '1's.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/number-of-unique-good-subsequences/
+// discuss: https://leetcode.com/problems/number-of-unique-good-subsequences/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn number_of_unique_good_subsequences(binary: String) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1987_example_1() {
+        let binary = "001".to_string();
+
+        let result = 2;
+
+        assert_eq!(Solution::number_of_unique_good_subsequences(binary), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1987_example_2() {
+        let binary = "11".to_string();
+
+        let result = 2;
+
+        assert_eq!(Solution::number_of_unique_good_subsequences(binary), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1987_example_3() {
+        let binary = "101".to_string();
+
+        let result = 5;
+
+        assert_eq!(Solution::number_of_unique_good_subsequences(binary), result);
+    }
+}