📜 WAYPOINT LESSON
Simulation I — The Complete Set
⭐⭐⭐ advanced⏳ 25 min read📍 Lesson 248 of 281
Hidden-topic problem: shortest substring covering all k letters. No hints; the pipeline is the method.
Simulation I. No topic announced. Model it, check the budget, find the sweep. The interleaved test defeats chunk-greedy scans — if your first idea was 'windows aligned to k', the pipeline's observe stage just saved your submission.