DSA,
visualised.
Pick a topic. Get the intuition, watch it run, and read full LeetCode-style code with click-to-reveal comments. More topics are on the way — Graphs is live now.
Topics
1 live · more coming soonGraphs
BFS & DFS hubs — traversals, islands, cycles, shortest paths, topo sort, backtracking.
Open →Arrays & Hashing
Prefix sums, hashing, frequency maps, two-sum family.
Two Pointers
Opposite ends, fast/slow, partitioning.
Sliding Window
Fixed & variable windows, longest/shortest.
Stack & Queue
Monotonic stack, next-greater, deque tricks.
Binary Search
On answer, on arrays, boundary conditions.
Linked List
Reversal, cycle detection, merging.
Trees
Traversals, BST, LCA, recursion patterns.
Tries
Prefix trees, word search, autocomplete.
Heap / PQ
Top-K, merge K, scheduling, median.
Backtracking
Subsets, permutations, combinations, N-Queens.
Dynamic Programming
1D/2D DP, knapsack, LIS, intervals.
Greedy
Exchange argument, intervals, scheduling.
Intervals
Merge, insert, overlap counting.
Bit Manipulation
Masks, XOR tricks, subsets via bits.
Math & Geometry
Number theory, matrices, sweep lines.