Curated Interview & Engineering Pathways

Structured Learning Roadmaps

Step-by-step milestone pathways. Guru automatically selects and guides you through your next optimal problem.

Interview Prep

DSA FAANG Interview 75

The essential 75 coding interview patterns covering Arrays, Two Pointers, Sliding Window, Trees, Graphs, and Dynamic Programming.

Roadmap Progress25%
2 of 8 Steps Completed
Guru Recommended Next Step:

Step 3: Sliding Window (Contiguous Subarrays)

Continue Roadmap

Milestone Hierarchy

Arrays & Dynamic SizingArrays

Master in-place manipulation, prefix sums, and element lookup.

Two Pointers & Squeeze TechniqueTwo Pointers

Optimize quadratic nested loops into linear O(N) dual-pointer sweeps.

3
Sliding Window (Fixed & Dynamic)Sliding Window

Track running subarrays and contiguous sequences with O(1) state transitions.

4
Hash Tables & Complement CountingHash Table

Constant time frequency tables, sets, and anagram invariants.

Binary Search in Monotonic SpacesBinary Search

Halve the search space for sorted arrays and rotated inflection points.

Locked
Binary Trees & BFS/DFS TraversalTrees

Recursive divide-and-conquer, level-order queues, and subtree validation.

Locked
Graphs & Topological SortGraphs

Cycle detection, connected components, and shortest-path BFS.

Locked
Dynamic Programming (1D & 2D States)Dynamic Programming

Memoization tables, recurrence relations, and knapsack optimization.

Locked