DSA Roadmap — Algocraft

Phase 1

Foundations — Sorting & Searching

0/9

Start here regardless of experience level — these build the array-manipulation muscle memory (pointers, swaps, partitions) that every later phase leans on.

Phase 2

Stacks, Strings & Sliding Window

0/6

The monotonic-stack and sliding-window patterns show up constantly in interviews — learn them once here, recognize them everywhere after.

Valid Parentheses Next Greater Element Min Stack Sliding Window Maximum Longest Substring Without Repeating Characters KMP Pattern Matching

Phase 3

Linked Lists

0/7

Pointer manipulation without an index to lean on — a different kind of careful than arrays. LRU Cache at the end combines it with a hashmap, a very common interview question.

Linked List Add at Head Linked List Add at Tail Linked List Insert at Index Linked List Delete at Index Linked List Concat Linked List Reverse LRU Cache

Phase 4

Trees & Heaps

0/6

Recursion finally pays off visually — traversals first to build intuition, then BST and heap operations that depend on them.

Binary Tree Inorder Traversal Binary Tree Preorder Traversal Binary Tree Postorder Traversal Binary Tree Level Order Traversal BST Insert, Search, Delete Heap Insert and Delete

Phase 5

Backtracking

0/2

Short phase, but an important shift in thinking: explore a choice, undo it if it fails, try the next one.

N-Queens Sudoku Solver

Phase 6

Graphs

0/5

BFS/DFS are the foundation nearly every graph algorithm builds on, including the shortest-path and spanning-tree algorithms that follow.

Phase 7

Dynamic Programming

0/8

The phase most people find hardest — start with Fibonacci and Coin Change to see the recurrence-to-table pattern before the 2D problems (LCS, Edit Distance, Unique Paths).

Phase 8

Greedy & Advanced

0/2

The finish line — proving a locally-best choice leads to a globally-best answer, without DP's exhaustive bookkeeping.

Interval Scheduling Huffman Coding

The DSA Roadmap