Interview Roadmap
The complete core curriculum, ordered from fundamentals through advanced interview patterns.
Outcome: Build broad interview readiness across the patterns that appear most often.
Module 1: Foundations
Warm up with iteration, strings, counting, and simple numeric reasoning.
Module 2: Arrays & Hashing
Use sets, maps, sorting, prefixes, and matrix traversal.
1
Contains Duplicate
Not started
2
Valid Anagram
Not started
3
Two Sum
Not started
4
First Unique Character in a String
Not started
5
Majority Element
Not started
6
Single Number
Not started
7
Maximum Subarray
Not started
8
Product of Array Except Self
Not started
9
Group Anagrams
Not started
10
Merge Intervals
Not started
11
Spiral Matrix
Not started
12
Kth Largest Element in an Array
Not started
13
Top K Frequent Elements
Not started
14
3Sum
Not started
15
Longest Consecutive Sequence
Not started
16
Rotate Image
Not started
17
Insert Interval
Not started
18
Non-overlapping Intervals
Not started
19
Meeting Rooms II
Not started
20
Sort Colors
Not started
21
Minimum Size Subarray Sum
Not started
22
K Closest Points to Origin
Not started
Module 3: Pointers, Windows, Search & Stacks
Control sequence boundaries and maintain useful state efficiently.
1
Palindrome String
Not started
2
Is Subsequence
Not started
3
Move Zeroes
Not started
4
Find the Index of the First Occurrence in a String
Not started
5
Binary Search
Not started
6
Search Insert Position
Not started
7
Valid Parentheses
Not started
8
Daily Temperatures
Not started
9
Longest Common Prefix
Not started
10
Best Time to Buy and Sell Stock
Not started
11
Longest Substring Without Repeating Characters
Not started
12
Container With Most Water
Not started
13
Trapping Rain Water
Not started
14
Largest Rectangle in Histogram
Not started
15
Sliding Window Maximum
Not started
16
Minimum Window Substring
Not started
17
Median of Two Sorted Arrays
Not started
18
Longest Valid Parentheses
Not started
19
Search in Rotated Sorted Array
Not started
Module 4: Linked Structures & Cache Design
Rewire node chains and combine hash lookup with recency state.
1
Reverse Linked List
Not started
2
Palindrome Linked List
Not started
3
Merge Two Sorted Lists
Not started
4
Linked List Cycle
Not started
5
Reorder List
Not started
6
Merge K Sorted Lists
Not started
7
LRU Cache
Not started
8
Add Two Numbers
Not started
9
Remove Nth Node From End of List
Not started
10
Swap Nodes in Pairs
Not started
11
Reverse Linked List II
Not started
12
Linked List Cycle II
Not started
13
Odd Even Linked List
Not started
Module 5: Binary Trees & Search Trees
Build recursive invariants, then exploit binary-search-tree ordering.
1
Maximum Depth of Binary Tree
Not started
2
Invert Binary Tree
Not started
3
Same Tree
Not started
4
Symmetric Tree
Not started
5
Diameter of Binary Tree
Not started
6
Binary Tree Maximum Path Sum
Not started
7
Validate Binary Search Tree
Not started
8
Binary Tree Level Order Traversal
Not started
9
Lowest Common Ancestor of a BST
Not started
10
Kth Smallest Element in a BST
Not started
11
Path Sum
Not started
12
Binary Tree Right Side View
Not started
13
Convert Sorted Array to Binary Search Tree
Not started
14
Merge Two Binary Trees
Not started
15
Path Sum II
Not started
16
Construct Binary Tree from Preorder & Inorder
Not started
Module 6: Graphs, Connectivity & Shortest Paths
Progress from grid traversal to topology, union-find, and weighted paths.
1
Number of Islands
Not started
2
Rotting Oranges
Not started
3
Clone Graph
Not started
4
Pacific Atlantic Water Flow
Not started
5
Course Schedule
Not started
6
Alien Dictionary
Not started
7
Redundant Connection
Not started
8
Number of Provinces
Not started
9
Connected Components in an Undirected Graph
Not started
10
Accounts Merge
Not started
11
Word Ladder
Not started
12
Network Delay Time
Not started
13
Cheapest Flights Within K Stops
Not started
14
Longest Increasing Path in a Matrix
Not started
Module 7: Backtracking, Tries & Stateful Design
Explore choice trees, prefix structures, and operation-driven APIs.
1
Letter Combinations of a Phone Number
Not started
2
Subsets
Not started
3
Permutations
Not started
4
Combination Sum
Not started
5
Palindrome Partitioning
Not started
6
Word Search
Not started
7
Implement Trie
Not started
8
Design Add and Search Words
Not started
9
Min Stack
Not started
10
Word Search II
Not started
11
Find Median from Data Stream
Not started
12
Range Sum Query - Mutable
Not started
Module 8: Dynamic Programming & Greedy
Recognize reusable subproblems and prove locally optimal choices.
1
Climbing Stairs
Not started
2
Counting Bits
Not started
3
Decode Ways
Not started
4
House Robber
Not started
5
Jump Game
Not started
6
Coin Change
Not started
7
Palindromic Substrings
Not started
8
Longest Palindromic Substring
Not started
9
Word Break
Not started
10
Longest Increasing Subsequence
Not started
11
Gas Station
Not started
12
Task Scheduler
Not started
13
Jump Game II
Not started
14
Edit Distance
Not started
Module 9: Math & Combinatorics
Count paths and primes, convert bases, and reason about number-theoretic cycles.
