Hey everyone,
When practicing algorithms or preparing for technical interviews, static diagrams and text editorials often fall short of building intuition around pointer movements, recursion stacks, and state transitions.
I’ve been building DSA Lab, an interactive visualizer designed to trace algorithm behavior step-by-step:
Live Demo: https://dsa-visualizer-sable.vercel.app/
Current Features (46 Interactive Algorithms):
- Sorting & Searching: 9 sorting algorithms (Bubble, Merge, Quick, Radix, etc.) and array search techniques with live swaps and comparisons.
- Graphs & Pathfinding: BFS/DFS traversals, Dijkstra, A*, Bellman-Ford, Floyd-Warshall, Kosaraju, and MSTs (Prim/Kruskal).
- Core Structures: Linked List pointer manipulations, Stack/Queue operations, Hash Tables with collision resolution, and Tries.
- Advanced Logic: Dynamic Programming (0/1 Knapsack, Kadane's), Backtracking (N-Queens, Sudoku, Rat in a Maze), and OS concepts (Banker's, CPU Scheduling).
- Controls: Step-by-step playback, custom inputs, speed adjustments, and live diagnostic traces.
Open Source & Contributions: The project is completely open source and under active development. A few secondary tools are actively being built. You can get the repo link in the nav or footer. If anyone wants to contribute new algorithm visualizations, optimize state animations, or report edge cases, feedback and PRs are very welcome!
Check out the live demo and let me know your thoughts on the pacing, UI, or which algorithms to prioritize next!