Interactive Systems & DSA Flows
Explore complex software architectures and classic data structure algorithms through step-by-step, interactive visual simulations. Click into a module below to start.
Binary Tree Boundary Traversal
Visualize Left Boundary, Leaf Nodes, and Right Boundary traversal steps interactively in a customizable Binary Tree.
Vertical Order Traversal
Watch nodes group mathematically by their Horizontal Distances (HD) in a specialized coordinate-mapped BFS projection.
Dutch National Flag Algorithm
Understand the 3-Pointer technique to sort an array of 0s, 1s, and 2s in linear $O(N)$ time with constant space.
Moore's Voting Algorithm
Watch the algorithmic "tug of war" efficiently find the majority element in $O(N)$ time and $O(1)$ space using a two-phase process.
Kadane's Algorithm
Track Local and Global Maximums to efficiently find the contiguous subarray with the largest sum in $O(N)$ time.
3 Sum Algorithm
Explore the $O(N^2)$ Two-Pointer optimization. Watch the anchor pointer fix elements while left and right boundaries converge.
Inversion Count (Merge Sort)
An inversion is a pair of elements (i, j) such that i < j and arr[i] > arr[j]. A brute-force approach checks every pair, taking $O(N^2)$ time. By modifying the Merge Sort algorithm, we can count inversions in $O(N \log N)$ Time and $O(N)$ Space.