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.
71 problems to write
- Trees
- Grids
- Dynamic programming
- Still being written4
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.
Create a free account to choose one, or sign in.
Arrays
Hash maps, prefix products and the first habits of a careful solver.
0 / 10
Binary
Bits: counting, flipping and adding without a plus.
0 / 5
-
Sum of Two Integers Free account
-
Number of 1 Bits Free account
-
Counting Bits Free account
-
Missing Number Free account
-
Reverse Bits Free account
Dynamic programming
Break a problem into smaller ones you have already solved.
0 / 11
-
Climbing Stairs Free account
-
Coin Change Free account
-
Longest Increasing Subsequence Free account
-
Longest Common Subsequence Free account
-
Word Break Free account
-
Combination Sum IV Free account
-
House Robber Free account
-
House Robber II Free account
-
Decode Ways Free account
-
Unique Paths Free account
-
Jump Game Free account
Graphs
Search a world of connected things: islands, courses, clones.
0 / 7
-
Clone Graph Coming
-
Course Schedule Free account
-
Pacific Atlantic Water Flow Free account
-
Number of Islands Free account
-
Longest Consecutive Sequence Free account
-
Alien Dictionary Free account
-
Graph Valid Tree Free account
-
Number of Connected Components in an Undirected Graph Free account
Intervals
Ranges on a line: merge them, insert into them, schedule around them.
0 / 5
-
Insert Interval Free account
-
Merge Intervals Free account
-
Non-overlapping Intervals Free account
-
Meeting Rooms Free account
-
Meeting Rooms II Free account
Linked lists
Pointers you rewire by hand.
0 / 5
- Reverse Linked List New
-
Linked List Cycle Coming
-
Merge Two Sorted Lists Free account
-
Merge k Sorted Lists Free account
-
Remove Nth Node From End of List Free account
-
Reorder List Free account
Matrices
Grids: walk them, rotate them, search them.
0 / 4
-
Set Matrix Zeroes Free account
-
Spiral Matrix Free account
-
Rotate Image Free account
-
Word Search Free account
Strings
Windows, anagrams, brackets and palindromes.
0 / 9
-
Longest Substring Without Repeating Characters Free account
-
Longest Repeating Character Replacement Free account
-
Minimum Window Substring Free account
- Valid Anagram New
-
Group Anagrams Free account
- Valid Parentheses New
-
Valid Palindrome Free account
-
Longest Palindromic Substring Free account
-
Palindromic Substrings Free account
-
Encode and Decode Strings Coming
Trees
Recursion on branching shapes, and search trees.
0 / 13
-
Maximum Depth of Binary Tree Free account
-
Same Tree Free account
-
Invert Binary Tree Free account
-
Binary Tree Maximum Path Sum Free account
-
Binary Tree Level Order Traversal Free account
-
Serialize and Deserialize Binary Tree Coming
-
Subtree of Another Tree Free account
-
Construct Binary Tree from Preorder and Inorder Traversal Free account
-
Validate Binary Search Tree Free account
-
Kth Smallest Element in a BST Free account
-
Lowest Common Ancestor of a Binary Search Tree Free account
-
Implement Trie (Prefix Tree) Free account
-
Design Add and Search Words Data Structure Free account
-
Word Search II Free account
Heaps
Always know the smallest, largest or middle.
0 / 3
-
Merge k Sorted Lists Free account
-
Top K Frequent Elements Free account
-
Find Median from Data Stream Free account