1994. The Number of Good Subsets: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1502,3 +1502,4 @@ mod s1987_number_of_unique_good_subsequences;
 mod s1991_find_the_middle_index_in_array;
 mod s1992_find_all_groups_of_farmland;
 mod s1993_operations_on_tree;
+mod s1994_the_number_of_good_subsets;

src/solution/s1994_the_number_of_good_subsets.rs

@@ -0,0 +1,84 @@
+/**
+ * [1994] The Number of Good Subsets
+ *
+ * You are given an integer array nums. We call a subset of nums good if its product can be represented as a product of one or more distinct prime numbers.
+ *
+ * 	For example, if nums = [1, 2, 3, 4]:
+ *
+ * 		[2, 3], [1, 2, 3], and [1, 3] are good subsets with products 6 = 2*3, 6 = 2*3, and 3 = 3 respectively.
+ * 		[1, 4] and [4] are not good subsets with products 4 = 2*2 and 4 = 2*2 respectively.
+ *
+ *
+ *
+ * Return the number of different good subsets in nums modulo 10^9 + 7.
+ * A subset of nums is any array that can be obtained by deleting some (possibly none or all) elements from nums. Two subsets are different if and only if the chosen indices to delete are different.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [1,2,3,4]
+ * Output: 6
+ * Explanation: The good subsets are:
+ * - [1,2]: product is 2, which is the product of distinct prime 2.
+ * - [1,2,3]: product is 6, which is the product of distinct primes 2 and 3.
+ * - [1,3]: product is 3, which is the product of distinct prime 3.
+ * - [2]: product is 2, which is the product of distinct prime 2.
+ * - [2,3]: product is 6, which is the product of distinct primes 2 and 3.
+ * - [3]: product is 3, which is the product of distinct prime 3.
+ *
+ * Example 2:
+ *
+ * Input: nums = [4,2,3,15]
+ * Output: 5
+ * Explanation: The good subsets are:
+ * - [2]: product is 2, which is the product of distinct prime 2.
+ * - [2,3]: product is 6, which is the product of distinct primes 2 and 3.
+ * - [2,15]: product is 30, which is the product of distinct primes 2, 3, and 5.
+ * - [3]: product is 3, which is the product of distinct prime 3.
+ * - [15]: product is 15, which is the product of distinct primes 3 and 5.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 10^5
+ * 	1 <= nums[i] <= 30
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/the-number-of-good-subsets/
+// discuss: https://leetcode.com/problems/the-number-of-good-subsets/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn number_of_good_subsets(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1994_example_1() {
+        let nums = vec![1, 2, 3, 4];
+
+        let result = 6;
+
+        assert_eq!(Solution::number_of_good_subsets(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1994_example_2() {
+        let nums = vec![4, 2, 3, 15];
+
+        let result = 5;
+
+        assert_eq!(Solution::number_of_good_subsets(nums), result);
+    }
+}