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
Merge Intervals
Not started
10
Spiral Matrix
Not started
11
Kth Largest Element in an Array
Not started
12
Top K Frequent Elements
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
Longest Common Prefix
Not started
9
Best Time to Buy and Sell Stock
Not started
10
Longest Substring Without Repeating Characters
Not started
11
Container With Most Water
Not started
12
Trapping Rain Water
Not started
13
Largest Rectangle in Histogram
Not started
14
Sliding Window Maximum
Not started
15
Median of Two Sorted Arrays
Not started
16
Longest Valid Parentheses
Not started
Module 4: Linked Structures & Cache Design
Rewire node chains and combine hash lookup with recency state.
Module 5: Binary Trees & Search Trees
Build recursive invariants, then exploit binary-search-tree ordering.
Module 6: Graphs, Connectivity & Shortest Paths
Progress from grid traversal to topology, union-find, and weighted paths.
Module 7: Backtracking, Tries & Stateful Design
Explore choice trees, prefix structures, and operation-driven APIs.
Module 8: Dynamic Programming & Greedy
Recognize reusable subproblems and prove locally optimal choices.
1
Climbing Stairs
Not started
2
House Robber
Not started
3
Jump Game
Not started
4
Coin Change
Not started
5
Palindromic Substrings
Not started
6
Longest Palindromic Substring
Not started
7
Word Break
Not started
8
Longest Increasing Subsequence
Not started
9
Jump Game II
Not started
10
Edit Distance
Not started
