DSA Interview Prep

Syllabus

1. Module 1

   Foundations

   Build a solid base with core CS fundamentals, complexity analysis, recursion, and sorting.

   4 lessons

   1. What Is DSA? →
   2. Big-O Notation Explained →
   3. Recursion Fundamentals →
   4. Sorting Algorithms Overview →

2. Module 2

   Linear Data Structures

   Master arrays, linked lists, stacks, queues, and hash maps — the building blocks of most interview problems.

   6 lessons

   1. Arrays Introduction →
   2. Arrays Common Operations →
   3. Linked Lists Introduction →
   4. Linked Lists Common Operations →
   5. Stacks and Queues Introduction →
   6. Hashing and Hash Maps →

3. Module 3

   Trees and Heaps

   Navigate binary trees, master traversal patterns, and learn heap and trie data structures.

   5 lessons

   1. Binary Trees Introduction →
   2. Binary Trees Traversals →
   3. LeetCode Tree Traversal Patterns →
   4. Heap and Priority Queue Introduction →
   5. Trie Data Structure Introduction →

4. Module 4

   Graphs

   Explore graph representations, traversal algorithms, topological sort, shortest paths, and union-find.

   7 lessons

   1. Graphs Introduction →
   2. Graphs BFS and DFS →
   3. Topological Sort Explained →
   4. Floyd-Warshall All-Pairs Shortest Paths →
   5. Graph Coloring and Bipartite Check →
   6. LeetCode Graph Traversal Patterns →
   7. Union-Find Disjoint Set →

5. Module 5

   Searching and Sliding Window

   Apply binary search, two pointers, and sliding window techniques to solve problems efficiently.

   6 lessons

   1. Searching and Binary Search →
   2. Binary Search on Answer →
   3. LeetCode Binary Search Patterns →
   4. Two Pointers Technique →
   5. Sliding Window Technique →
   6. LeetCode Sliding Window Patterns →

6. Module 6

   Dynamic Programming and Backtracking

   Tackle DP from first principles, solve classic problems, and master backtracking patterns.

   5 lessons

   1. Dynamic Programming Introduction →
   2. Dynamic Programming Classic Problems →
   3. LeetCode Dynamic Programming Patterns →
   4. Backtracking Patterns →
   5. LeetCode Backtracking Patterns →

7. Module 7

   Greedy and Mixed Patterns

   Round out your toolkit with greedy algorithms, monotonic stack, string matching, and divide and conquer.

   6 lessons

   1. Greedy Algorithms Introduction →
   2. LeetCode Greedy Algorithm Patterns →
   3. Monotonic Stack Patterns →
   4. KMP String Matching Algorithm →
   5. LeetCode Stack and Queue Patterns →
   6. Divide and Conquer Introduction →