Roadmap
Built incrementally. Here's what's live and what's coming next.
Data Structures
- shipped
2D Arrays
Custom colors, presets, learning panel
- 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
Graph
Adjacency list & matrix views
Sorting & techniques
- shipped
Sorting
Bubble, Selection & Insertion — step-through, speed control, pseudocode & live stats
- shipped
Time complexity / Big-O
Live growth-curve playground — measure O(1)…O(2ⁿ) by operations or real time
- 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
- planned
Graph algorithms
BFS, DFS, Dijkstra
- planned
Dynamic programming
Classic DP tables (LCS, knapsack)
Have a suggestion? Open an issue.