DSA for Interviews

Recap — Reading Time and Space Complexity

Arrays & Strings: Two Pointers and Sliding Window

Recap — Two Pointers and Sliding Window Patterns

HashMaps & HashSets

Recap — When to Reach for a HashMap

Stacks, Queues & Monotonic Stack

Recap — Stack and Queue Patterns

Trees, Graphs, and RecursionFREE PREVIEW

Recursion and backtracking; binary trees and traversals (DFS pre/in/post, BFS level order); BSTs and heaps; graph representations and BFS/DFS; weighted-graph algorithms (Dijkstra, topological sort).

110 min10 lessons

Recursion & Backtracking

Recap — Recursion and Backtracking Templates

Binary Trees & Traversals

Recap — Tree Traversal Patterns

Binary Search Trees & Heaps

Recap — BST and Heap Mental Models

Graphs: Representation & BFS/DFS

Recap — Graph Representation and Traversal

Graph Algorithms (Dijkstra, Topological Sort)

Recap — Dijkstra and Topological Sort

Dynamic Programming Basics

Advanced PatternsFREE PREVIEW

Dynamic programming (memoization to tabulation); greedy and interval problems; binary search variations (including binary-search-on-answer); bit manipulation tricks.

85 min8 lessons

Recap — From Memoization to Tabulation

Greedy & Interval Problems

Recap — When Greedy Works (and When It Doesn't)

Binary Search Variations

Recap — Binary Search on the Answer

Recap — Bit Tricks Worth Memorizing

Bit Manipulation

9 min

9 min

Mock 1 — Arrays, Strings, Hashmaps (45 min)

Mock Interview PracticeFREE PREVIEW

Six timed mock interviews covering arrays/hashmaps, linked lists, trees, graphs, DP, and a full 90-min combined session. Approach scripts, communication tips, and detailed solution walkthroughs.

450 min6 lessons

45 min

Mock 2 — Linked Lists (45 min)

45 min

Mock 3 — Trees (60 min)

60 min

Mock 4 — Graphs (60 min)

60 min

Mock 5 — Dynamic Programming (60 min)

60 min

Mock 6 — Full 90-Min Interview (90 min)

90 min