Tap here to switch tabs
Problem
Submissions

Problem: Binary Subarrays With Sum

Binary Subarrays With Sum asks you to count non-empty, contiguous subarrays in a binary array whose elements add up to a specified goal.

Statement

You are given a binary array, nums, and an integer, goal. Your task is to return the number of non-empty subarraysThis refers to a subarray, which is a contiguous part of the array. with a sum that meets the goal.

Constraints:

  • 1≤1 \leq nums.length ≤3×104\leq 3 \times 10^4

  • nums[i] is either 00 or 11.

  • 0≤0 \leq goal ≤\leq nums.length

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Binary Subarrays With Sum

Binary Subarrays With Sum asks you to count non-empty, contiguous subarrays in a binary array whose elements add up to a specified goal.

Statement

You are given a binary array, nums, and an integer, goal. Your task is to return the number of non-empty subarraysThis refers to a subarray, which is a contiguous part of the array. with a sum that meets the goal.

Constraints:

  • 1≤1 \leq nums.length ≤3×104\leq 3 \times 10^4

  • nums[i] is either 00 or 11.

  • 0≤0 \leq goal ≤\leq nums.length