Track · LeetCode

Interview prep. Communicate the trade-offs, not just the answer.

Walkthroughs that explain the thinking, not just the code. New problems every Tuesday.

7 free courses · 1 paid course · updated weekly

All Arrays Conditionals Sieves Strings Trees Graphs DP Greedy Bit Manipulation System Design

All levels Easy Medium Hard

Courses

Multi-video · project-based

We iterate from a nested-loop pair check to a single-pass scan that only remembers the most recent 1 and 2. The "last-s…

We iterate from a brute-force pair check through a divisor sieve, then drop the constant factor with numpy. Inverting t…

We iterate from a brute-force scan to a two-pass sweep that precomputes a right-min array and walks a running left-max.…

We iterate from a brute-force scan to a two-pass sweep that walks a running max from each end. The "two-pass running ma…