Practice Binary Subarrays With Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Binary Subarrays With Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,0,1,0,1], goal = 2
Output
4
# Example 2
Input
nums = [0,0,0,0,0], goal = 0
Output
15
Constraints
1 <= nums.length <= 3 * 10^4
nums[i] is either 0 or 1.
0 <= goal <= nums.length
Related LeetCode Problems
Practice more problems similar to Binary Subarrays With Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.