Level 1 · Foundations
Arrays
About 42 steps, from the first idea to a mastery test.
Stage 0What an array is3 stepsFree
Stage 1Traversal4 stepsFree
- 1A loop visits every box6 min
- 2Count what matches6 min
- 3Stop when you find it7 min
- 4Walk backwards7 min
Stage 2Traversal with state4 stepsFree
- 1Remember the best so far7 min
- 2Two things at once6 min
- 3Carry a total forward7 min
- 4Compare with the previous box9 min
Stage 3In-place changes4 stepsFree
- 1Change every box where it is5 min
- 2Reverse in place8 min
- 3A write position9 min
- 4Remove in place8 min
Stage 4Rotation3 stepsFree
- 1Rotate right by one7 min
- 2Rotate by k, with a copy9 min
- 3Rotate in place10 min
Stage 5Two pointers4 stepsFree
- 1Pair sum in a sorted array8 min
- 2Count pairs below a target10 min
- 3Squares in sorted order10 min
- 4Merge two sorted lists10 min
Stage 6Arrays and hashing4 stepsFree
Stage 7Prefix sums4 stepsFree
- 1Pay once, answer fast9 min
- 2Left side, right side8 min
- 3Same total twice9 min
- 4Count stretches that hit k10 min
Stage 8Sliding window4 stepsFree
- 1Slide, don't re-add8 min
- 2Judge every window8 min
- 3Grow, then shrink10 min
- 4Keep the window valid10 min
Stage 9Kadane’s algorithm4 stepsFree
- 1Extend or start fresh10 min
- 2Flip the question6 min
- 3Around the corner10 min
- 4Cheapest so far8 min
Stage 10Mastery4 stepsFree
- 1Balanced bits12 min
- 2Best window, no repeats12 min
- 3Widest container12 min
- 4Best product12 min