Tibeb Library
Review queue

Week

Two Pointers & Sliding Window

Use boundaries, ordering, and incrementally maintained state to replace repeated scans with deliberate linear passes.

  1. 01 Two Pointers: One Search, Two BoundariesLearn what pointers represent, why ordering makes movement safe, and how two boundaries avoid repeated work. 65 min
  2. 02 Choosing Which Pointer MovesDerive pointer movement from bottlenecks and known boundaries instead of memorizing arrows. 70 min
  3. 03 3Sum and Sort Colors: Pair Search and PartitioningUse sorting to expose structure, reduce multi-value searches, and maintain several settled regions. 75 min
  4. 04 Sliding Windows That Grow and ShrinkMaintain a contiguous region incrementally and distinguish shrinking while invalid from shrinking while valid. 75 min
  5. 05 Fixed Windows With Frequency CountsSlide a constant-width region and compare its contents using incrementally updated counts. 65 min
  6. 06 Sliding Windows: Character Replacement and Minimum Window SubstringTranslate complex character requirements into a measurable window-validity condition. 80 min