Unstub

Quests 11 chapters · 56 problems

Patterns
One technique a chapter, past the basics.

56 problems in 11 chapters of one technique each: strings, windows, maps, stacks, queues, lists, trees, graphs, binary search, backtracking and dynamic programming. A good road to the Classic 75.

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

Try one first · Write49 problems

Reverse Words in a String
Something new.

Return the words of s in reverse order, joined by single spaces, with no spaces at either end. s may have extra spaces anywhere.

Start writing Stuck? Recall · Fill

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

What's inside

11 chapters

49 problems to write

  • Stacks and queues
  • Trees
  • Grids
  • Still being written7

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

11 chapters · 56 problems

Strings and parsing

Read, rebuild and compare text a character at a time.
0 / 5
  1. Reverse Words in a String Up next
  2. String to Integer (atoi) New
  3. Reverse Integer New
  4. Count and Say New
  5. Determine if Two Strings Are Close New

Arrays, numbers and bits

Rotate, mark and compare without a second copy.
0 / 5

Sliding windows

A stretch that grows on one side and shrinks on the other.
0 / 3

Maps and sets

Count, pair and check in one pass.
0 / 3

Stacks

The last thing kept is the first thing used, and a stack kept in order.
0 / 6

Queues and design

Rounds in turn, and objects that keep their own state.
0 / 2

Linked lists

Rewire the nodes with a pointer or two.
0 / 3

Trees

Carry something down every branch, or go level by level.
0 / 5

Graphs

Search out what is connected, deepest first or nearest first.
0 / 6

Search and order

Halve a range, sort to narrow, and keep the smallest next.
0 / 6

Choices and tables

Try each choice and take it back, or keep a table of answers.
0 / 5