Retrieval: which window is this?

Two problems rebuilt cold, plus the distinction between maximizing and minimizing windows.

Quick check· 5 min

Which shape does this problem want?

Find the shortest stretch of an array whose sum is at least a target, with all values positive. Which loop shape fits?

Minimizing: grow until the sum reaches the target, then shrink while it still does, recording inside the shrink loopMaximizing: grow, and shrink while the sum exceeds the target, recording after the shrink loopA fixed-width window, since the target implies the widthNot a window problem; it needs prefix sums with a hash map

Problem· 15 min

Longest Substring Without Repeating Characters, from scratch

You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.

Problem· 15 min

Container With Most Water, from scratch

Sliding Window

27 / 170

Sliding WindowLesson 6 of 6About 40 min

Retrieval: which window is this?

Two problems rebuilt cold, plus the distinction between maximizing and minimizing windows.

Quick check· 5 min

Which shape does this problem want?

Find the shortest stretch of an array whose sum is at least a target, with all values positive. Which loop shape fits?

Problem· 15 min

Longest Substring Without Repeating Characters, from scratch

Problem· 15 min