Unstub

Quests 9 chapters · 55 problems

Warm-ups
Short problems, one idea each.

Every easy problem here, in nine short chapters: maps and sets, two pointers, one pass, text and numbers, bits, stacks and lists, trees, sorting and small steps. A gentle way in before the bigger lists.

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

Try one first · Write51 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

9 chapters

51 problems to write

  • Arrays
  • Trees
  • Hash maps and sets
  • 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

9 chapters · 55 problems

Count and look up

A map or a set answers in one step.
0 / 7
  1. Two Sum Up next
  2. Contains Duplicate New
  3. Valid Anagram New
  4. First Unique Character in a String New
  5. Intersection of Two Arrays II New
  6. Unique Number of Occurrences New
  7. Find the Difference of Two Arrays New

Two pointers

Two places moving through a list or a string together.
0 / 7

One pass

Keep the best, the total or the count as you go.
0 / 7
  1. Best Time to Buy and Sell Stock New

Text and numbers

Read numerals, build rows, and find what strings share.
0 / 7

Bits

Xor, shifts and counting ones.
0 / 6

Stacks, queues and lists

Brackets on a stack, calls in a queue, and links turned round.
0 / 5
  1. Valid Parentheses New
  2. Reverse Linked List New

Trees

Recursion down a tree, one node at a time.
0 / 8

Small steps

Each answer from the few just before it.
0 / 3