Free interactive tools
Algorithm Visualizers
Practice common algorithm patterns in the browser with step-by-step state changes, highlighted decisions, and related tools for adjacent problems.
Array and interval patterns
Step through sorted arrays, range preprocessing, window movement, pointer updates, interval merges, and stack-based scans.
Binary Search Visualizer Visualize binary search online. Paste a sorted array, choose exact search or lower bound, and inspect low, high, mid, comparisons, and result index.
Sorting Algorithm Visualizer Visualize sorting algorithms online. Paste an array and step through bubble sort, insertion sort, selection sort, merge sort, or quick sort. Prefix Sum Visualizer Visualize prefix sum arrays online. Paste values, build cumulative sums step by step, choose a range, and inspect how range sum queries work. Sliding Window Visualizer Visualize sliding window algorithms online. Paste an array, run fixed-size or variable-size windows, and inspect left, right, sum, and best result. Two Pointers Visualizer Visualize two pointer algorithms online. Paste values, run sorted pair sum or container area, and inspect left and right pointer movement. Merge Intervals Visualizer Visualize merge intervals online. Paste interval pairs, sort by start value, step through overlap checks, and inspect the merged output. Monotonic Stack Visualizer Visualize monotonic stack algorithms online. Paste an array, choose next greater or previous smaller mode, and step through stack pushes, pops, and results.
Sorting Algorithm Visualizer Visualize sorting algorithms online. Paste an array and step through bubble sort, insertion sort, selection sort, merge sort, or quick sort. Prefix Sum Visualizer Visualize prefix sum arrays online. Paste values, build cumulative sums step by step, choose a range, and inspect how range sum queries work. Sliding Window Visualizer Visualize sliding window algorithms online. Paste an array, run fixed-size or variable-size windows, and inspect left, right, sum, and best result. Two Pointers Visualizer Visualize two pointer algorithms online. Paste values, run sorted pair sum or container area, and inspect left and right pointer movement. Merge Intervals Visualizer Visualize merge intervals online. Paste interval pairs, sort by start value, step through overlap checks, and inspect the merged output. Monotonic Stack Visualizer Visualize monotonic stack algorithms online. Paste an array, choose next greater or previous smaller mode, and step through stack pushes, pops, and results.Dynamic programming and recursion
Inspect table filling, recurrence choices, recursion trees, branching search, and game-tree decisions.
Fibonacci DP Visualizer Visualize Fibonacci dynamic programming online. Choose n, fill the tabulation table, and inspect how each value reuses the previous two answers. Coin Change DP Visualizer Visualize coin change dynamic programming online. Enter coin values and a target amount, then step through minimum-coin DP updates. Knapsack DP Visualizer Visualize 0/1 knapsack dynamic programming online. Paste item weights and values, set capacity, inspect the DP table, and recover selected items. Longest Increasing Subsequence Visualizer Visualize longest increasing subsequence dynamic programming online. Paste numbers, compare prior indexes, and backtrack one LIS. Longest Common Subsequence Visualizer Visualize longest common subsequence dynamic programming online. Enter two strings, fill the LCS table, and backtrack one subsequence. Edit Distance Visualizer Visualize edit distance online. Enter two strings, fill the Levenshtein DP table, and inspect insert, delete, substitute, and match decisions. Recursion Tree Visualizer Visualize recursion trees and call stacks online. Choose factorial, Fibonacci, or binary recursion and inspect calls, returns, depth, and stack frames. Backtracking Visualizer Visualize backtracking online. Generate subsets or permutations, inspect the recursion stack, decision tree, current path, and completed results. N-Queens Visualizer Visualize the N-Queens backtracking algorithm online. Choose a board size, step through queen placements, rejected attacks, backtracking, and solutions. Minimax Algorithm Visualizer Visualize the minimax algorithm online with Tic-Tac-Toe. Edit a board, score legal moves, inspect game-tree search counts, and find the best move.
Trees, heaps, and range queries
Compare binary trees, search trees, balanced trees, heaps, trie prefixes, range structures, and overlap search.
Binary Tree Visualizer Visualize a binary tree from level-order input. Paste LeetCode-style values, render the tree, and run common traversal orders in your browser.
Binary Search Tree Visualizer Visualize binary search tree operations online. Paste an insertion-order array, render the BST, and run search, delete, insert, and traversal steps. AVL Tree Visualizer Visualize AVL tree insertion, search paths, balance factors, and rotations. Paste values and see a self-balancing binary search tree online. Red Black Tree Visualizer Visualize red black tree insertion online. Paste values, inspect node colors, rotations, recoloring, black height, and search paths.
Heap Visualizer Visualize min heap and max heap operations online. Paste an array, build a binary heap, insert values, extract the root, and inspect heap order. Trie Visualizer Build and visualize a trie online. Paste words, search prefixes, autocomplete matches, and inspect how a prefix tree stores strings. Segment Tree Visualizer Visualize segment tree range sum queries online. Build a tree from an array, inspect overlap decisions, and preview point updates. Fenwick Tree Visualizer Visualize Fenwick tree and Binary Indexed Tree range sums online. Build BIT slots, trace prefix jumps, and preview point updates. Sparse Table Visualizer Visualize sparse table range minimum and maximum queries online. Build power-of-two levels and inspect the two blocks used for RMQ. Interval Tree Visualizer Visualize interval tree overlap search online. Build an augmented BST, inspect subtree max values, and trace interval overlap queries.
Binary Search Tree Visualizer Visualize binary search tree operations online. Paste an insertion-order array, render the BST, and run search, delete, insert, and traversal steps. AVL Tree Visualizer Visualize AVL tree insertion, search paths, balance factors, and rotations. Paste values and see a self-balancing binary search tree online. Red Black Tree Visualizer Visualize red black tree insertion online. Paste values, inspect node colors, rotations, recoloring, black height, and search paths. Heap Visualizer Visualize min heap and max heap operations online. Paste an array, build a binary heap, insert values, extract the root, and inspect heap order. Trie Visualizer Build and visualize a trie online. Paste words, search prefixes, autocomplete matches, and inspect how a prefix tree stores strings. Segment Tree Visualizer Visualize segment tree range sum queries online. Build a tree from an array, inspect overlap decisions, and preview point updates. Fenwick Tree Visualizer Visualize Fenwick tree and Binary Indexed Tree range sums online. Build BIT slots, trace prefix jumps, and preview point updates. Sparse Table Visualizer Visualize sparse table range minimum and maximum queries online. Build power-of-two levels and inspect the two blocks used for RMQ. Interval Tree Visualizer Visualize interval tree overlap search online. Build an augmented BST, inspect subtree max values, and trace interval overlap queries.Related tool hubs
Data Structure Visualizers Use free data structure visualizers for lists, stacks, queues, trees, graphs, arrays, recursion, DP, sorting, and algorithm patterns.Graph Algorithm Visualizers Use free graph algorithm visualizers for BFS, DFS, Dijkstra, A Star, Bellman Ford, Floyd Warshall, topological sort, Kruskal, and Prim.String Algorithm Visualizers Use free string algorithm visualizers for KMP, Rabin Karp, Z algorithm, edit distance, and longest common subsequence.
Algorithm Visualizers FAQ
What is an algorithm visualizer?
An algorithm visualizer is an interactive tool that shows each important state change while an algorithm runs, such as comparisons, swaps, pointer movement, table updates, or graph relaxations.
Are these algorithm visualizers free?
Yes. The RavensMove algorithm visualizers are free browser tools and do not require an account.
Which visualizer should I start with?
Start with binary search, sorting, stack and queue, or graph BFS DFS if you are learning fundamentals. Move to dynamic programming, shortest paths, and range-query structures after that.