Minimum Size Subarray Sum: coding question

Available question text

Find the length of the shortest contiguous subarray of positive integers whose sum is at least a given target (return 0 if none exists). This is a classic sliding-window / two-pointer problem exploiting positivity of nums to get an O(n) solution (follow-up asks for an O(n log n) alternative).

Continue with questions that share topics or the same question type.

Shortest Subarray with Sum at Least K
Coding · Array · Binary Search · Heap (Priority Queue)
Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
Subarray Product Less Than K
Coding · Array · Binary Search · Prefix Sum
Max Consecutive Ones III
Coding · Array · Binary Search · Prefix Sum

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Toast
Leetcode 209. Minimum Size Subarray Sum
Reported Aug 13, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 3 records

Bloomberg
Minimum Size Subarray Sum
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 59.6. This is not an interview probability.
View source
Bloomberg
Minimum Size Subarray Sum
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 61.8. This is not an interview probability.
View source
Meta
Minimum Size Subarray Sum
Reported date not specified · Source window: 6mo

Minimum Size Subarray Sum

Available question text

Related questions

Minimum Size Subarray Sum

Available question text

Related questions