Given an integer array nums and an integer target, return the maximum number of non overlapping, non empty subarrays where the sum of elements in each subarray equals target.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $-10^4 \leq$ nums[i] $\leq 10^4$

• $0 \leq$ target $\leq 10^6$

Now, 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.