DSA & Coding Interviews
Build a foundation in data structures and problem solving.
Arrays & Hashing
Two Pointers
Prerequisites: Arrays & Hashing
Stack
Prerequisites: Arrays & Hashing
Binary Search
Prerequisites: Two Pointers
Sliding Window
Prerequisites: Two Pointers
Linked List
Prerequisites: Two Pointers
Trees
Prerequisites: Binary Search, Linked List
Tries
Prerequisites: Trees
Backtracking
Prerequisites: Trees
Heap / Priority Queue
Prerequisites: Trees
Graphs
Prerequisites: Backtracking
1-D Dynamic Programming
Prerequisites: Backtracking
Intervals
Prerequisites: Heap / Priority Queue
Greedy
Prerequisites: Heap / Priority Queue
Advanced Graphs
Prerequisites: Heap / Priority Queue, Graphs
2-D Dynamic Programming
Prerequisites: Graphs, 1-D Dynamic Programming
Bit Manipulation
Prerequisites: 1-D Dynamic Programming
Math & Geometry
Prerequisites: 2-D Dynamic Programming, Bit Manipulation