Available question text
Given an array of positive integers, find the k-th smallest sum among all contiguous subarray sums. Because elements are positive, you can binary-search the target sum and use a sliding-window / two-pointer or prefix-sum counting method to decide how many subarrays have sum ≤ mid.
Related questions
Continue with questions that share topics or the same question type.
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 1918. Kth Smallest Subarray Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source