2275. Largest Combination With Bitwise AND Greater Than Zero: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1723,3 +1723,4 @@ mod s2271_maximum_white_tiles_covered_by_a_carpet;
 mod s2272_substring_with_largest_variance;
 mod s2273_find_resultant_array_after_removing_anagrams;
 mod s2274_maximum_consecutive_floors_without_special_floors;
+mod s2275_largest_combination_with_bitwise_and_greater_than_zero;

src/solution/s2275_largest_combination_with_bitwise_and_greater_than_zero.rs

@@ -0,0 +1,74 @@
+/**
+ * [2275] Largest Combination With Bitwise AND Greater Than Zero
+ *
+ * The bitwise AND of an array nums is the bitwise AND of all integers in nums.
+ *
+ * 	For example, for nums = [1, 5, 3], the bitwise AND is equal to 1 & 5 & 3 = 1.
+ * 	Also, for nums = [7], the bitwise AND is 7.
+ *
+ * You are given an array of positive integers candidates. Compute the bitwise AND for all possible combinations of elements in the candidates array.
+ * Return the size of the largest combination of candidates with a bitwise AND greater than 0.
+ *  
+ * Example 1:
+ *
+ * Input: candidates = [16,17,71,62,12,24,14]
+ * Output: 4
+ * Explanation: The combination [16,17,62,24] has a bitwise AND of 16 & 17 & 62 & 24 = 16 > 0.
+ * The size of the combination is 4.
+ * It can be shown that no combination with a size greater than 4 has a bitwise AND greater than 0.
+ * Note that more than one combination may have the largest size.
+ * For example, the combination [62,12,24,14] has a bitwise AND of 62 & 12 & 24 & 14 = 8 > 0.
+ *
+ * Example 2:
+ *
+ * Input: candidates = [8,8]
+ * Output: 2
+ * Explanation: The largest combination [8,8] has a bitwise AND of 8 & 8 = 8 > 0.
+ * The size of the combination is 2, so we return 2.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= candidates.length <= 10^5
+ * 	1 <= candidates[i] <= 10^7
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/
+// discuss: https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn largest_combination(candidates: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2275_example_1() {
+        let candidates = vec![16, 17, 71, 62, 12, 24, 14];
+
+        let result = 4;
+
+        assert_eq!(Solution::largest_combination(candidates), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2275_example_2() {
+        let candidates = vec![8, 8];
+
+        let result = 2;
+
+        assert_eq!(Solution::largest_combination(candidates), result);
+    }
+}