Watch 10 video solutions for Binary Subarrays With Sum, a medium level problem involving Array, Hash Table, Sliding Window. This walkthrough by Ashish Pratap Singh has 1,002,144 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal.
A subarray is a contiguous part of the array.
Example 1:
Input: nums = [1,0,1,0,1], goal = 2 Output: 4 Explanation: The 4 subarrays are bolded and underlined below: [1,0,1,0,1] [1,0,1,0,1] [1,0,1,0,1] [1,0,1,0,1]
Example 2:
Input: nums = [0,0,0,0,0], goal = 0 Output: 15
Constraints:
1 <= nums.length <= 3 * 104nums[i] is either 0 or 1.0 <= goal <= nums.length