Available question text
Find the smallest positive sum of any contiguous subarray whose length is between l and r (inclusive). This reduces to scanning prefix sums and for each end index querying candidate start prefixes at distances in [l,r] (e.g., via a multiset/ordered set) to find the minimal positive prefix-difference.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Size Subarray Sum
Coding · Array · Binary Search · Prefix Sum
- Minimum Value to Get Positive Step by Step Sum
Coding
- Continuous Subarray Sum
Coding
- Determine the Minimum Sum of a k-avoiding Array
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 3364. Minimum Positive Sum Subarray
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source