Unstub

Quests 10 chapters · 75 problems

The Classic 75
The classic interview list, one stage at a time.

Seventy-five problems in ten chapters, from arrays to heaps. Each stage has three levels: fill the blanks, recall the key lines, then write the whole function.

Try Arrays, the first chapter, without an account. Create a free account to open every problem and keep your stars.

Try one first · Write71 problems

Two Sum
Something new.

Find the two numbers in nums that add up to target, and return their indices.

Start writing Stuck? Recall · Fill

Write → step down → come backOr join for a few a day.

What's inside

10 chapters

71 problems to write

  • Trees
  • Grids
  • Dynamic programming
  • Still being written4

How do you want to study this?

Three ways

Choose a plan and a pace. Each day brings a few problems from it, on your dashboard and in the extension. You can change it whenever you like.

  • Steady pathA little every daySomething new to write each day, and what needed help back a few days on.
  • Deep diveOne problem at a timeOne problem each day until you write it on your own; then a new one, of the same kind first.
  • Interview countdownEverything by a dateTry every problem by the day you choose, and write again what needed help.

Create a free account to choose one, or sign in.

The path

10 chapters · 75 problems

Arrays

Hash maps, prefix products and the first habits of a careful solver.
0 / 10
  1. Two Sum Up next
  2. Best Time to Buy and Sell Stock New
  3. Contains Duplicate New
  4. Product of Array Except Self New
  5. Maximum Subarray New
  6. Maximum Product Subarray New
  7. Find Minimum in Rotated Sorted Array New
  8. Search in Rotated Sorted Array New
  9. 3Sum New
  10. Container With Most Water New

Binary

Bits: counting, flipping and adding without a plus.
0 / 5

Dynamic programming

Break a problem into smaller ones you have already solved.
0 / 11

Graphs

Search a world of connected things: islands, courses, clones.
0 / 7

Intervals

Ranges on a line: merge them, insert into them, schedule around them.
0 / 5

Linked lists

Pointers you rewire by hand.
0 / 5
  1. Reverse Linked List New

Matrices

Grids: walk them, rotate them, search them.
0 / 4

Strings

Windows, anagrams, brackets and palindromes.
0 / 9
  1. Valid Anagram New
  2. Valid Parentheses New

Trees

Recursion on branching shapes, and search trees.
0 / 13

Heaps

Always know the smallest, largest or middle.
0 / 3