Data Structures and Algorithms Roadmap
Mind map of the data structures and algorithms topics to learn for coding interviews and campus placements.
How it flows
- DSA Roadmap for Placements → Arrays & Strings
- DSA Roadmap for Placements → Linked Lists
- DSA Roadmap for Placements → Stacks & Queues
- DSA Roadmap for Placements → Trees
- DSA Roadmap for Placements → Graphs
- DSA Roadmap for Placements → Hashing
- DSA Roadmap for Placements → Sorting & Searching
- DSA Roadmap for Placements → Recursion
- DSA Roadmap for Placements → Dynamic Programming
- DSA Roadmap for Placements → Greedy
- Arrays & Strings → Two Pointers
- Arrays & Strings → Sliding Window
- Arrays & Strings → Prefix Sum
- Arrays & Strings → String Manipulation
- Linked Lists → Singly & Doubly LL
- Linked Lists → Fast & Slow Pointers
- Linked Lists → Reversal & Cycle Detection
- Stacks & Queues → Monotonic Stack
- Stacks & Queues → Deque / Sliding Window Max
- Stacks & Queues → Priority Queue (Heap)
- Trees → BST
- Trees → Tree Traversals (BFS/DFS)
- Trees → Segment Tree / Fenwick Tree
- Trees → Trie
- Graphs → BFS & DFS
- Graphs → Shortest Path (Dijkstra, BF)
- Graphs → Topological Sort
- Graphs → Union-Find (DSU)
- Hashing → HashMap / HashSet
- Hashing → Frequency Count
- Hashing → Anagram & Subarray Problems
- Sorting & Searching → Merge / Quick / Heap Sort
- Sorting & Searching → Binary Search & Variants
- Sorting & Searching → Order Statistics
- Recursion → Backtracking
- Recursion → Divide & Conquer
- Recursion → Permutations & Combinations
- Dynamic Programming → 0/1 Knapsack
- Dynamic Programming → LCS / LIS
- Dynamic Programming → DP on Strings & Grids
Components
Central Topic · DSA Roadmap for Placements · Arrays & Strings · Linked Lists · Stacks & Queues · Trees · Graphs · Hashing · Sorting & Searching · Recursion · Dynamic Programming · Greedy · Two Pointers · Sliding Window · Prefix Sum · String Manipulation · Singly & Doubly LL · Fast & Slow Pointers · Reversal & Cycle Detection · Monotonic Stack · Deque / Sliding Window Max · Priority Queue (Heap) · BST · Tree Traversals (BFS/DFS) · Segment Tree / Fenwick Tree · Trie · BFS & DFS · Shortest Path (Dijkstra, BF) · Topological Sort · Union-Find (DSU) · HashMap / HashSet · Frequency Count · Anagram & Subarray Problems · Merge / Quick / Heap Sort · Binary Search & Variants · Order Statistics · Backtracking · Divide & Conquer · Permutations & Combinations · 0/1 Knapsack · LCS / LIS · DP on Strings & Grids · Activity Selection · Interval Scheduling · Huffman / MST (Kruskal, Prim)