MediumNo. 1546
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target — LeetCode 1546 Python Solution
- Pattern
- Prefix Sum
- Topics
- Greedy, Array, Hash Table, Prefix Sum
- Reading time
- 3 min
- Source
- leetcode.com
The problem
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
- 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).
Python solution
class Solution:
def maxNonOverlapping(self, nums: List[int], target: int) -> int:
ans = 0
i, n = 0, len(nums)
while i < n:
s = 0
vis = {0}
while i < n:
s += nums[i]
if s - target in vis:
ans += 1
break
i += 1
vis.add(s)
i += 1
return ansComplexity
- Time
- O(n)
- Space · auxiliary
- O(n)
Pattern: Prefix Sum
Precompute running totals once so any range query becomes a single subtraction. LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target is filed here because LeetCode tags it Prefix Sum, which is the vocabulary this hub collects.
The prefix sum guide has the Python template for the pattern and the 157 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0523 | Continuous Subarray Sum | Medium |
| 0525 | Contiguous Array | Medium |
| 0560 | Subarray Sum Equals K | Medium |
| 0621 | Task Scheduler | Medium |
| 0632 | Smallest Range Covering Elements from K Lists | Hard |
| 0659 | Split Array into Consecutive Subsequences | Medium |
Frequently asked questions
- How hard is LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target?
LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target is rated Medium on LeetCode.
- What is the time complexity of LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target?
The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target?
The Python solution on this page uses O(n) auxiliary space.
- What topics does LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target cover?
LeetCode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target is tagged Greedy, Array, Hash Table and Prefix Sum on LeetCode.