1248. Count Number of Nice Subarrays
Medium74.8% acceptance467,979 / 625,623 submissions
Asked by 9 companies
Topics
Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it.
Return the number of nice sub-arrays.
Example 1:
Input: nums = [1,1,2,1,1], k = 3 Output: 2 Explanation: The only sub-arrays with 3 odd numbers are [1,1,2,1] and [1,2,1,1].
Example 2:
Input: nums = [2,4,6], k = 1 Output: 0 Explanation: There are no odd numbers in the array.
Example 3:
Input: nums = [2,2,2,1,2,2,1,2,2,2], k = 2 Output: 16
Constraints:
1 <= nums.length <= 500001 <= nums[i] <= 10^51 <= k <= nums.length
Hints
Hint 1
After replacing each even by zero and every odd by one can we use prefix sum to find answer ?
Hint 2
Can we use two pointers to count number of sub-arrays ?
Hint 3
Can we store the indices of odd numbers and for each k indices count the number of sub-arrays that contains them ?