1803. Count Pairs With XOR in a Range: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1359,3 +1359,4 @@ mod s1799_maximize_score_after_n_operations;
 mod s1800_maximum_ascending_subarray_sum;
 mod s1801_number_of_orders_in_the_backlog;
 mod s1802_maximum_value_at_a_given_index_in_a_bounded_array;
+mod s1803_count_pairs_with_xor_in_a_range;

src/solution/s1803_count_pairs_with_xor_in_a_range.rs

@@ -0,0 +1,89 @@
+/**
+ * [1803] Count Pairs With XOR in a Range
+ *
+ * Given a (0-indexed) integer array nums and two integers low and high, return the number of nice pairs.
+ *
+ * A nice pair is a pair (i, j) where 0 <= i < j < nums.length and low <= (nums[i] XOR nums[j]) <= high.
+ *
+ *  
+ * Example 1:
+ *
+ *
+ * Input: nums = [1,4,2,7], low = 2, high = 6
+ * Output: 6
+ * Explanation: All nice pairs (i, j) are as follows:
+ *     - (0, 1): nums[0] XOR nums[1] = 5
+ *     - (0, 2): nums[0] XOR nums[2] = 3
+ *     - (0, 3): nums[0] XOR nums[3] = 6
+ *     - (1, 2): nums[1] XOR nums[2] = 6
+ *     - (1, 3): nums[1] XOR nums[3] = 3
+ *     - (2, 3): nums[2] XOR nums[3] = 5
+ *
+ *
+ * Example 2:
+ *
+ *
+ * Input: nums = [9,8,4,2,1], low = 5, high = 14
+ * Output: 8
+ * Explanation: All nice pairs (i, j) are as follows:
+ * ​​​​​    - (0, 2): nums[0] XOR nums[2] = 13
+ *     - (0, 3): nums[0] XOR nums[3] = 11
+ *     - (0, 4): nums[0] XOR nums[4] = 8
+ *     - (1, 2): nums[1] XOR nums[2] = 12
+ *     - (1, 3): nums[1] XOR nums[3] = 10
+ *     - (1, 4): nums[1] XOR nums[4] = 9
+ *     - (2, 3): nums[2] XOR nums[3] = 6
+ *     - (2, 4): nums[2] XOR nums[4] = 5
+ *
+ *  
+ * Constraints:
+ *
+ *
+ * 	1 <= nums.length <= 2 * 10^4
+ * 	1 <= nums[i] <= 2 * 10^4
+ * 	1 <= low <= high <= 2 * 10^4
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/count-pairs-with-xor-in-a-range/
+// discuss: https://leetcode.com/problems/count-pairs-with-xor-in-a-range/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn count_pairs(nums: Vec<i32>, low: i32, high: i32) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1803_example_1() {
+        let nums = vec![1, 4, 2, 7];
+        let low = 2;
+        let high = 6;
+
+        let result = 6;
+
+        assert_eq!(Solution::count_pairs(nums, low, high), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1803_example_1() {
+        let nums = vec![1, 4, 2, 7];
+        let low = 2;
+        let high = 6;
+
+        let result = 6;
+
+        assert_eq!(Solution::count_pairs(nums, low, high), result);
+    }
+}