Interactive visualizations for data structures and algorithms
Reverse a singly linked list using three pointers
Remove all nodes with duplicate values from a sorted linked list
Detect cycle and find entry point using Floyd's algorithm
Swap every two adjacent nodes in a linked list
Traverse tree level by level in zigzag pattern using BFS and queue
Connect nodes at same level using BFS with queue
Count downward paths that sum to target using prefix sums and DFS
Check if a binary tree satisfies BST properties using recursive DFS
Flatten tree to right-skewed linked list in-place using Morris Traversal
Find maximum path sum in tree where path can start and end at any node
Count separate islands in a 2D grid using BFS flood-fill
Find all nodes exactly K edges away from target using BFS with parent links
Find minimum time for all oranges to rot using multi-source BFS
Find shortest word transformation sequence using BFS
Find valid course order using DFS topological sort on prerequisite graph
Count connected components in adjacency matrix using DFS
Find maximum money to rob from houses in a circle using dynamic programming
Find length of longest subsequence common to both strings using dynamic programming
Count number of ways to make amount using coins with dynamic programming
Find path with minimum sum from top-left to bottom-right in grid
49 of 49 algorithms visualized