Share Feedback
Help us improve this platform
Step-by-step hand-drawn pattern animations. Inspect state variables, watch memory call stacks, trace pointers, and master coding interview concepts visually.
Click any visualizer card below to step through animations
Opposite-ends & fast-slow pointer walks (Two Sum II, 3Sum, Container Water)
Contiguous subarray/substring window algorithms (Fixed K sum, Longest Substring, Min Subarray Sum)
State space tree search and constraint pruning (N-Queens, Sudoku Solver, Subsets)
Access, insertion, deletion, prefix sum, and array reversals
Bubble, Selection, Insertion, Quick, and Merge Sort step-by-step
Binary search tree lookups, Inorder, Preorder, and Postorder traversals
BFS level-order, DFS recursion, Cycle detection, and Dijkstra shortest path
Singly traversal, head insertion, deletion, and three-pointer reversal
Push, pop, peek operations, and Valid Parentheses matching
Enqueue, dequeue, circular queue modulo ring buffer
Min-Heap insert bubble-up, extract min bubble-down, Max-Heapify, Heap Sort
Sequential linear search and binary search halving
Call stack winding/unwinding (Factorial, Fibonacci, Tower of Hanoi, Subsets)
1D & 2D memoization grids (Climbing Stairs, Knapsack, LCS, Coin Change)
Separate chaining linked lists, open addressing linear probing, Two Sum, Anagrams
Character-by-character tree insertion, word lookup, prefix search, and autocomplete