python3

javascript

java

Binary Subarrays With Sum

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.

### Input Format
First Parameter:  Length of array ``n``

Second Parameter: Array of int ``nums``

Third Parameter: Integer ``goal``
### Output Format
Return the integer
### Example 1
```
Input: nums = [1,0,1,0,1], goal = 2
Output: 4
Explanation: The 4 possible subarrays with sum 2: 
[1,0,1]
[1,0,1,0]
[0,1,0,1]
[1,0,1]
```
### 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
- Expected Time Complexity - O(n logn) 
- Expected Space Complexity - O(1)

def solve(n, nums, goal):
    # CODE HERE

function solve(n, nums, goal){
// CODE HERE
}

int solve(int n, vector<int> nums, int goal){
//CODE HERE 
}

static int solve(int n, int[] nums, int goal){
//CODE HERE 
}