Given an array of integers nums and an integer k, return the number of subarrays of nums where the bitwise AND of the elements of the subarray equals k.
Example 1:
Input: nums = [1,1,1], k = 1
Output: 6
Explanation:
All subarrays contain only 1's.
Example 2:
Input: nums = [1,1,2], k = 1
Output: 3
Explanation:
Subarrays having an AND value of 1 are: [1,1,2], [1,1,2], [1,1,2].
Example 3:
Input: nums = [1,2,3], k = 2
Output: 2
Explanation:
Subarrays having an AND value of 2 are: [1,2,3], [1,2,3].
Constraints:
1 <= nums.length <= 1050 <= nums[i], k <= 109Solutions for this problem are being prepared.
Try solving it yourselfCount Subarray sum Equals K | Brute - Better -Optimal • take U forward • 446,156 views views
Watch 9 more video solutions →Practice Number of Subarrays With AND Value of K with our built-in code editor and test cases.
Practice on FleetCode