01 — problem
Minimum Size Subarray Sum — LeetCode #?. Full problem statement, examples, and constraints live at https://leetcode.com/problems/minimum-size-subarray-sum. PatternLens tracks this problem for pattern coverage and progress tracking.
02 — notes
Full examples and constraints live on the original LeetCode prompt. Use the link in the sidebar when you want the canonical statement.
03 — hints
Start by identifying the core sliding window - dynamic size idea that reduces the search space.
If you get stuck, check whether a standard sliding window - dynamic size technique applies here.