Available question text
Given an array nums and a target, find the maximum number of non-overlapping contiguous subarrays whose sums equal target. The core challenge is detecting subarray sums efficiently (via prefix sums) while choosing disjoint segments greedily or with DP to maximize the count under the non-overlap constraint.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Sum of 3 Non-Overlapping Subarrays
Coding
- Maximum Sum of Two Non-Overlapping Subarrays
Coding · Array · Dynamic Programming · Sliding Window
- Find Two Non-overlapping Sub-arrays Each With Target Sum
Coding
- Maximum Number of Non-overlapping Palindrome Substrings
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source