DSA Roadmap - Advanced

Follow this step-by-step roadmap to master dsa at Advanced level

1

Graphs Basics

3 weeks

▹Graph Representation (Adjacency List, Matrix)
▹DFS & BFS
▹Connected Components
▹Cycle Detection
▹Topological Sort
▹Mini-Project: Maze Solver

2

Graphs Advanced

4 weeks

▹Shortest Path (Dijkstra, Bellman-Ford, Floyd-Warshall)
▹Minimum Spanning Tree (Prim’s, Kruskal’s)
▹Disjoint Set Union (Union-Find)
▹Strongly Connected Components (Kosaraju, Tarjan)
▹Network Flow (Ford-Fulkerson, Edmonds-Karp)
▹Mini-Project: Road Map Navigation

3

Advanced Dynamic Programming

4 weeks

▹Matrix Chain Multiplication
▹Longest Increasing Subsequence
▹Edit Distance
▹DP on Trees
▹DP on Graphs
▹Bitmask DP
▹Mini-Project: Optimal Game Strategy

4

String Algorithms

3 weeks

▹Trie Data Structure
▹Suffix Array & Suffix Tree (basics)
▹Z Algorithm
▹Manacher’s Algorithm (Longest Palindromic Substring)
▹Aho-Corasick Algorithm
▹Mini-Project: Autocomplete System

5

Advanced Topics

4 weeks

▹Segment Trees
▹Fenwick Tree (Binary Indexed Tree)
▹Disjoint Set (Union by Rank & Path Compression)
▹Sparse Table
▹Mo’s Algorithm
▹Heavy-Light Decomposition
▹Mini-Project: Range Query System

6

Competitive Programming & Interview Prep

4 weeks

▹Problem-Solving Patterns (Greedy, Divide & Conquer, Sliding Window)
▹Codeforces/LeetCode/AtCoder Practice
▹Mock Interview Problems
▹Optimizing Solutions & Edge Cases

GeekDost - Roadmaps & Snippets for Developers