Skip to content
TryAlgoViz
Algorithms
Articles
CS Fundamentals
Playground
Problems
Roadmap
About
Dashboard
Theme
Collapse
Sign in to track your progress and unlock all stages
Sign In
✦ DSA Roadmap
Master Data Structures
& Algorithms
Complete each stage to unlock the next · Visualize every concept
Begin your journey →
📖
STAGE 01
Foundations
0/15
completed
0%
★
Basic Programming Concepts
📖
Star Patterns — Practicing Nested Loops
▶
Right Triangle
</>
Print a Right Triangle
▶
Pyramid
</>
Print a Pyramid
▶
Diamond
</>
Print a Diamond
▶
Butterfly
</>
Print a Butterfly
📖
What are Data Structures?
📖
What are Algorithms?
📖
Big O Notation — Time Complexity
📖
Space Complexity & the Time–Space Trade-off
?
Foundations Readiness Check
🗃️
STAGE 02
Searching
0/8
completed
0%
📖
First Occurrence Search (Linear Search Intuition)
▶
Linear Search
</>
Find Target in Array
📖
Binary Search Deep Dive
▶
Binary Search
</>
First Bad Version
</>
Search Insert Position
?
Searching Readiness Check
🔍
STAGE 03
Two Pointers & Sliding Window
0/8
completed
0%
📖
Two Pointers
▶
Two Pointers
▶
Valid Palindrome
📖
Sliding Window
▶
Sliding Window
▶
Max Average Subarray
▶
Max Consecutive Ones
?
Two Pointers Readiness Check
🗂️
STAGE 04
Basic Sorting
0/10
completed
0%
📖
Bubble Sort — Comparing Adjacent Pairs
▶
Bubble Sort
</>
Bubble Sort the Array
📖
Selection Sort — Repeated Minimum
▶
Selection Sort
</>
Selection Sort the Array
📖
Insertion Sort — Growing a Sorted Prefix
▶
Insertion Sort
</>
Insertion Sort the Array
?
Basic Sorting Readiness Check
🌲
STAGE 05
Stack & Queue
0/9
completed
0%
📖
Stacks — LIFO Mechanics
▶
Stack Operations
</>
Valid Parentheses
</>
Min Add to Make Parens Valid
📖
Queues — FIFO and Beyond
▶
Queue Operations
</>
Number of Recent Calls
</>
Implement Queue Using Stacks
?
Stack & Queue Readiness Check
⚡
STAGE 06
Linked List
0/8
completed
0%
📖
Linked Lists — Singly, Doubly, Circular
▶
Linked List Operations
</>
Middle of the Linked List
</>
Merge Two Sorted Lists
</>
Reverse Linked List
</>
Linked List Cycle (Floyd's Tortoise and Hare)
▶
Remove Nth From End
?
Linked List Readiness Check
🕸️
STAGE 07
Hash Map
0/8
completed
0%
📖
Hash Maps — Hashing, Collisions, Resolution Strategies
▶
Hash Map
▶
Chaining
▶
Linear Probing
</>
Two Sum
</>
Valid Anagram
</>
Group Anagrams
?
Hash Map Readiness Check
🛤️
STAGE 08
Trees
0/11
completed
0%
📖
Binary Trees — Structure and Recursion
📖
Tree DFS — Pre/In/Post Orderings
▶
Tree DFS (Pre/In/Post-order)
</>
Binary Tree Inorder Traversal
</>
Path Sum
</>
LCA (Binary Tree)
📖
Tree BFS — Level-order with a Queue
▶
Tree BFS (Level-order)
</>
Maximum Depth of Binary Tree
</>
Binary Tree Level Order Traversal
?
Trees Readiness Check
⛰️
STAGE 09
Heaps & Priority Queues
0/6
completed
0%
📖
Heaps & Priority Queues
▶
Min-Heap
▶
Max-Heap
▶
Build-Heap
▶
Heap Sort
?
Heaps Readiness Check
💡
STAGE 10
Binary Search Trees
0/7
completed
0%
📖
Binary Search Trees
▶
BST Search
▶
BST Insert
▶
Validate BST
▶
Lowest Common Ancestor
▶
Kth Smallest
?
BST Readiness Check
🔄
STAGE 11
Graphs
0/10
completed
0%
📖
Graphs — Representations
📖
Breadth-First Search
▶
Graph BFS
📖
Depth-First Search
▶
Graph DFS
📖
Dijkstra's Algorithm
▶
Dijkstra
📖
Bellman-Ford
▶
Bellman-Ford
?
Graphs Readiness Check
🏆
STAGE 12
Matrix / Grid Traversal
0/5
completed
0%
📖
Matrix & Grid Traversal
▶
Grid BFS
▶
Grid DFS
▶
Pathfinder
?
Matrix Readiness Check
📖
STAGE 13
Recursion & Backtracking
0/6
completed
0%
📖
Recursion & Backtracking
▶
N-Queens
▶
Sudoku Solver
▶
Tower of Hanoi
▶
Rat in a Maze
?
Backtracking Readiness Check
🗃️
STAGE 14
Dynamic Programming
0/10
completed
0%
📖
Dynamic Programming — Intro
📖
Fibonacci Memoization
▶
Fibonacci (Memo)
📖
0/1 Knapsack
▶
Knapsack
📖
Coin Change
▶
Coin Change
▶
Longest Common Subsequence
▶
Longest Increasing Subsequence
?
DP Readiness Check
🔍
STAGE 15
Greedy Algorithms
0/8
completed
0%
📖
Greedy Algorithms
▶
Activity Selection
▶
Fractional Knapsack
▶
Job Sequencing
📖
Huffman Coding
▶
Huffman Coding
▶
Greedy Coin Change
?
Greedy Readiness Check
🗂️
STAGE 16
Disjoint Set / Union-Find
0/5
completed
0%
📖
Disjoint Set (Union-Find)
▶
Union & Find
▶
Connected Components
▶
Cycle Detection
?
Union-Find Readiness Check
🌲
STAGE 17
Trie
0/5
completed
0%
📖
Tries — Prefix Trees
▶
Trie Operations
▶
Autocomplete
▶
Longest Common Prefix
?
Trie Readiness Check