DSA Roadmap - Intermediate

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

1

Linked List

3 weeks

▹Singly Linked List (Insert, Delete, Traverse)
▹Doubly Linked List
▹Circular Linked List
▹Reverse Linked List
▹Detect & Remove Loop
▹Merge Two Sorted Linked Lists
▹Mini-Project: Playlist Manager

2

Stacks & Queues

3 weeks

▹Stack Basics (Push, Pop, Peek)
▹Infix, Prefix, Postfix Expressions
▹Queue Basics
▹Circular Queue
▹Deque (Double Ended Queue)
▹Priority Queue
▹Mini-Project: Browser History Manager

3

Hashing

2 weeks

▹Hash Tables & Hash Maps
▹Collision Handling (Chaining, Open Addressing)
▹Applications (Frequency Count, Subarray Problems)
▹Set Implementation
▹Mini-Project: Word Counter

4

Recursion & DP Basics

4 weeks

▹Memoization vs Tabulation
▹Fibonacci DP
▹Climbing Stairs Problem
▹Knapsack (0/1, Unbounded)
▹Coin Change
▹Longest Common Subsequence
▹Mini-Project: DP-Based Game Solver

5

Binary Trees

3 weeks

▹Tree Terminology
▹Binary Tree Traversals (Inorder, Preorder, Postorder, Level Order)
▹Height & Diameter of Tree
▹Lowest Common Ancestor
▹Serialize & Deserialize Tree
▹Mini-Project: Expression Tree Evaluator

6

Binary Search Trees (BST)

2 weeks

▹BST Basics (Insert, Search, Delete)
▹Traversal in BST
▹Balanced BST (AVL, Red-Black Basics)
▹Kth Smallest & Largest Element
▹Range Queries
▹Mini-Project: Student Records Manager

7

Heaps

2 weeks

▹Min Heap & Max Heap
▹Heapify & Heap Sort
▹Priority Queue with Heap
▹Kth Largest/Smallest Problems
▹Median of Running Stream
▹Mini-Project: Task Scheduler

GeekDost - Roadmaps & Snippets for Developers