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 \leq$ nums.length $\leq 3 \times 10^4$

• nums[i] is either $0$ or $1$.

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

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.