Roadmap
Built incrementally. Here's what's live and what's coming next.
Data Structures
- shipped
1D Array Visualizer
Insert, delete, search and reverse, one step at a time.
- shipped
2D Array Visualizer
Paste a 2D array or matrix and see it as a grid.
- shipped
Grid Traversals
Six ways to walk a grid, one step at a time.
- shipped
Matrix Operations
Transpose, rotate, flip and multiply, one cell at a time.
- planned
Linked List
Singly & doubly linked, animated pointers
- planned
Stack
Push / pop with overflow visualization
- planned
Queue
FIFO + circular queue
- planned
Binary Tree / BST
Insert, traverse, search
- planned
Heap
Min & max heap with sift up and sift down
- planned
Graph
Adjacency list & matrix views
Sorting & techniques
- shipped
Big-O Playground
Count steps and watch real growth curves.
- shipped
Sorting Visualizer
Step through Bubble, Selection and Insertion sort.
- planned
Counting sort
Non-comparison sort built on a frequency array — O(n + k)
- planned
Frequency array
Count occurrences in O(n); the basis for counting sort & hashing
- planned
Merge sort
Divide & conquer, stable, O(n log n)
- planned
Quick sort
In-place partitioning, average O(n log n)
- planned
Binary search
Find a value in a sorted array in O(log n)
- planned
Prefix sums
Answer range-sum queries instantly after O(n) prep
- planned
Two pointers
Pair & subarray problems in a single O(n) pass
- planned
Sliding window
Running window for subarray sum / min / max
Algorithms
- shipped
Grid Algorithms
Flood fill, islands and BFS shortest path, step by step.
- planned
Graph algorithms
BFS, DFS and Dijkstra on adjacency lists
- planned
Dynamic programming
Classic DP tables (LCS, knapsack)
Have a suggestion? Open an issue.