Watch 10 video solutions for Maximum Number of Non-Overlapping Subarrays With Sum Equals Target, a medium level problem involving Array, Hash Table, Greedy. This walkthrough by Ashish Pratap Singh has 1,002,177 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given an array nums and an integer target, return the maximum number of non-empty non-overlapping subarrays such that the sum of values in each subarray is equal to target.
Example 1:
Input: nums = [1,1,1,1,1], target = 2 Output: 2 Explanation: There are 2 non-overlapping subarrays [1,1,1,1,1] with sum equals to target(2).
Example 2:
Input: nums = [-1,3,5,1,4,2,-9], target = 6 Output: 2 Explanation: There are 3 subarrays with sum equal to 6. ([5,1], [4,2], [3,5,1,4,2,-9]) but only the first 2 are non-overlapping.
Constraints:
1 <= nums.length <= 105-104 <= nums[i] <= 1040 <= target <= 106