2 docs tagged with "Sum"

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.

This is a solution to the Sum Multiples problem on LeetCode.