home/roadmaps/dsa
🎯 Interview Essential

🧠 DSA & Competitive Programming Roadmap

A 16-week structured plan to crack FAANG and top product company interviews. Covers everything from Big O to Dynamic Programming.

16 weeks📊 All levels₹15-50 LPA avg

💡 Strategy: Don't try to memorize solutions. Focus on recognizing patterns. Once you see the Two Pointer or Sliding Window pattern, dozens of problems become easy. Practice 2-3 problems per topic minimum before moving on.

Phase 1

Foundations (Week 1-2)

Time & Space Complexity (Big O)
Practice
Arrays & Strings
20 problems Practice
Two Pointers Pattern
10 problems Practice
Sliding Window Pattern
10 problems Practice
Phase 2

Core Data Structures (Week 3-5)

Linked Lists
15 problems Practice
Stacks & Queues
12 problems Practice
Hash Maps & Sets
15 problems Practice
Binary Search
15 problems Practice
Phase 3

Trees & Graphs (Week 6-9)

Binary Trees (BFS & DFS)
20 problems Practice
Binary Search Trees
10 problems Practice
Heaps & Priority Queues
10 problems Practice
Graphs (BFS, DFS, Dijkstra)
20 problems Practice
Phase 4

Dynamic Programming (Week 10-14)

1D DP (Fibonacci, Climbing Stairs)
10 problems Practice
2D DP (Grid problems)
10 problems Practice
Knapsack & Subset Problems
10 problems Practice
String DP (LCS, Edit Distance)
10 problems Practice
Phase 5

Interview Grind (Week 15-16)

NeetCode 150 - Revisit weak topics
30 problems Practice
Mock interviews (Pramp, Interviewing.io)
Practice
Blind 75 full pass
75 problems Practice
Company-specific LeetCode lists
30 problems Practice

After DSA → System Design

Once you're comfortable with DSA, add System Design to target senior roles and top companies.

Full Stack + System Design Roadmap