Scribd
Upload
0 views2 pages

DSA Interview Roadmap

The document outlines a DSA interview preparation roadmap categorized into three tiers: Tier 1 covers essential topics like arrays and recursion, Tier 2 includes trees and graph traversal, and Tier 3 focuses on advanced concepts like dynamic programming. It lists common interview questions and provides a structured 3-week study plan detailing daily topics to cover. The plan emphasizes a progressive learning approach, culminating in a mock interview and revision.

Uploaded by

Tamajit Hazra
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views2 pages

DSA Interview Roadmap

The document outlines a DSA interview preparation roadmap categorized into three tiers: Tier 1 covers essential topics like arrays and recursion, Tier 2 includes trees and graph traversal, and Tier 3 focuses on advanced concepts like dynamic programming. It lists common interview questions and provides a structured 3-week study plan detailing daily topics to cover. The plan emphasizes a progressive learning approach, culminating in a mock interview and revision.

Uploaded by

Tamajit Hazra
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

■ DSA Interview Preparation Roadmap

■ Tier 1 (Must-Know – High Priority ■)


• Arrays & Strings
• Recursion basics
• Linked List (singly, doubly)
• Stack & Queue implementation
• Searching (linear, binary)
• Sorting (bubble, insertion, selection)

■ Tier 2 (Medium Priority ■)


• Trees (binary tree, BST basics)
• Graph representation & traversal (BFS, DFS)
• Hashing (hashmap, hashset basics)
• Heaps & Priority Queues
• Advanced sorting (merge sort, quicksort)

■ Tier 3 (Low Priority – Advanced ■)


• Dynamic Programming (LCS, LIS, knapsack)
• Greedy algorithms
• Backtracking (N-Queens, Rat in a maze)
• Segment Trees & Tries
• Disjoint Set Union (Union-Find)

■ Most Common Interview Programs/Questions


• Reverse linked list
• Detect loop in linked list
• Balanced parentheses using stack
• Implement queue using stacks
• Binary search problems
• Mergesort & Quicksort implementation
• Level order traversal of tree
• Graph BFS & DFS
• 0/1 Knapsack using DP
• N-Queens problem

■ Suggested 3-Week Day-wise Plan

Week 1
• Day 1–2: Arrays & Strings
• Day 3: Recursion basics
• Day 4–5: Linked list
• Day 6: Stack & Queue
• Day 7: Searching & basic sorting

Week 2
• Day 8–9: Trees
• Day 10: Graph basics
• Day 11–12: BFS & DFS
• Day 13: Hashing
• Day 14: Heaps & Priority Queues

Week 3
• Day 15–16: Dynamic Programming
• Day 17: Greedy algorithms
• Day 18: Backtracking
• Day 19–20: Advanced DSA problems
• Day 21: Mock interview & revision

You might also like