All roadmaps
DSA
DSA Mastery
Master all major DSA topics from arrays to graphs, dynamic programming, and advanced trees.
Duration
12 weeks
Difficulty
Hard
Goal
FAANG Interviews
Modules
18 • 97 topics
What you'll achieve
Solve 300+ curated DSA problems across every major pattern
Confidently attempt medium/hard problems in 30–45 mins
Crack coding rounds at FAANG, Adobe, Uber, Atlassian
Full Syllabus
Every module and topic in this roadmap.
1
Foundations & Complexity
Time & Space ComplexityBig-O, Omega, ThetaRecursion basicsBit Manipulation
2
Arrays
Kadane's AlgorithmTwo PointersSliding WindowPrefix SumDutch National FlagMerge Intervals
3
Strings
String Matching (KMP, Rabin-Karp)Anagram ProblemsPalindrome ChecksLongest Substring Problems
4
Searching & Sorting
Binary Search VariationsMerge SortQuick SortCounting SortSearch in Rotated Array
5
Recursion & Backtracking
Subsets & PermutationsN-QueensSudoku SolverRat in a MazeWord Search
6
Linked Lists
Singly & Doubly LLReverse a LLCycle Detection (Floyd's)Merge Two Sorted ListsLRU Cache
7
Stacks & Queues
Next Greater ElementValid ParenthesesMin StackSliding Window MaximumCircular QueueMonotonic Stack
8
Hashing
HashMap & HashSetTwo Sum / Three SumLongest Consecutive SequenceGroup AnagramsSubarray Sum Equals K
9
Binary Search on Answer
Aggressive CowsBook AllocationPainter's PartitionKoko Eating BananasSplit Array Largest Sum
10
Trees (Binary Trees)
Traversals (Inorder, Pre, Post, Level)Height & DiameterLCAZigzag TraversalBoundary TraversalSerialize & Deserialize
11
Binary Search Trees
Insert, Delete, SearchValidate BSTKth SmallestFloor & Ceil in BSTBST from Preorder
12
Heaps & Priority Queues
Min Heap / Max HeapKth Largest ElementMerge K Sorted ListsTop K Frequent ElementsMedian in a Stream
13
Greedy Algorithms
Activity SelectionFractional KnapsackJob SequencingHuffman EncodingMinimum Platforms
14
Graphs
BFS & DFSCycle DetectionTopological SortDijkstra'sBellman-FordFloyd-WarshallMST (Kruskal, Prim)Bridges & Articulation Points
15
Dynamic Programming
0/1 KnapsackLCSLISMatrix Chain MultiplicationCoin ChangeEdit DistanceDP on TreesDP on GridsBitmask DP
16
Tries
Insert & SearchAuto-completeWord BreakMaximum XORCount Distinct Substrings
17
Segment Trees & BIT
Range Sum QueryRange Min/MaxLazy PropagationFenwick TreeCount Smaller After Self
18
Interview Masterclass
Top 50 FAANG patternsMock Interview StrategyCommunication TipsTime Management
Prerequisites
Basic C++/Java
Related resources
Start learning today
Unlock the Premium Vault to get curated problems, quizzes, and mentor-crafted notes for every module.