Sliding WindowUnion-FindTwo PointersBinary SearchSegment TreeTrieTopological SortDijkstraDP on TreesMonotonic StackSliding WindowUnion-FindTwo PointersBinary SearchSegment TreeTrieTopological SortDijkstraDP on TreesMonotonic Stack
Sliding WindowUnion-FindTwo PointersBinary SearchSegment TreeTrieTopological SortDijkstraDP on TreesMonotonic StackSliding WindowUnion-FindTwo PointersBinary SearchSegment TreeTrieTopological SortDijkstraDP on TreesMonotonic Stack
Open source · Built for CP grinders
Algorithms you see,
not just read.
Hand-crafted animations for every classic DSA problem. Each visualization is purpose-built — not a generic step-through. Contribute your own.
4+
Problems
3
Approaches each
Open
Source
Min Hamming Distance with Swaps
~6 minMedium
DSU + Hashing
0A
1B
2C
3D
4A
5B
//Watch DSU unions form components, then frequency maps resolve mismatches.
Pattern browser
Problems
Start visualizing.
#01
Union-Find
MediumMin Hamming Distance with Swaps
Rearrange elements within connected components to minimize Hamming distance.
~6 minArrays, Union-Find
ArraysUnion-FindFrequency Map
#02
Sliding Window
HardSubstring Concatenation of All Words
Find all starting indices where a window is a permutation of all given words.
~8 minStrings, Sliding Window
StringsSliding WindowHash Map
#03
Trees
MediumCreate Binary Tree From Descriptions
Build a binary tree from parent-child relations and detect the root.
~5 minTrees, Hash Map
TreesHash MapGraph to Tree
#04
Hash Map
EasyTwo Sum
Pick two numbers whose sum equals the target using a single pass.
~3 minArrays, Hash Map
ArraysHash Map
Open Source
Build the animation for
your favourite problem.
Each animation is self-contained. Add yours without touching anything else. PR welcome.