Engineering Curriculum

DSA Learning Roadmap

3-Month Targeted Plan for Working Software Engineers • Daily Commitment: 1.5–2 hrs

Structured roadmap designed to master coding interviews, core algorithmic paradigms, and system problem-solving.

Phase 1: Month 1 – Foundations & Easy Problems

📌 Week 1–2: Basics

  • Arrays (search, sort, rotate, reverse)
  • Strings (palindrome, anagram, character frequency)
  • Two pointers technique
  • Sliding Window (basic)
  • ✅ Platforms: [LeetCode Easy], [CodeStudio], [GFG Beginner]

📌 Week 3–4: Hashing & Recursion

  • Hashmap / Set
  • Recursion + Backtracking (factorial, subsets, permutations)
  • Stack (valid parentheses, next greater element)
  • Queue (circular queue, LRU cache basics)

Phase 2: Month 2 – Intermediate Topics & Problem Solving

📌 Week 5–6:

  • Linked List (Singly, Doubly, Reverse, Detect Loop)
  • Binary Search (on arrays, answers, matrix)
  • Sorting (Quick, Merge, Insertion, Bubble)

📌 Week 7–8:

  • Trees (Binary Tree, BST, traversal – DFS/BFS)
  • Heap & Priority Queue (k-largest, heap sort)
  • Sliding Window (advance)

Phase 3: Month 3 – Advanced DSA + Mock Interviews

📌 Week 9–10:

  • Graphs (BFS, DFS, Dijkstra, Union-Find, Topo Sort)
  • Dynamic Programming (Fibonacci, knapsack, LIS, LCS)

📌 Week 11–12:

  • Practice Top 150 LeetCode problems
  • Mock contests (LeetCode/Codeforces)