ALGORITHM LABORATORY

Interactive visualizations to build intuition. See the pointers move, watch the stack grow, and truly understand the machine.

Arrays

Sliding Window • Prefix Sum • Kadane • Two Pointers • Subarray Sum • Dutch Flag

Master the fundamentals of memory layout and pointer manipulation.

Start Visualizing

Sorting

Merge • Quick • Heap • Counting • Radix • Bucket

Visualize the divide and conquer strategies that power modern databases.

Start Visualizing

String

KMP • Rabin-Karp • Z-Algorithm • Trie • Suffix Array • LCS

Uncover hidden patterns in text using advanced string matching algorithms.

Start Visualizing

LinkedList

Singly • Doubly • Cycle • Reverse • Merge • Fast-Slow

Wire and re-wire nodes dynamically to understand pointer logic.

Start Visualizing

Stack

LIFO • Monotonic • Valid Parens • Next Greater • Min Stack • Histogram

Push and pop your way through expression parsing and history management.

Start Visualizing

Queue

FIFO • Priority • Deque • Sliding Max • BFS • Circular

Manage scheduling and buffering tasks with first-in-first-out logic.

Start Visualizing

Hashing

Maps • Sets • Collision • Two Sum • Group Anagrams • Subarray Sum

Learn how constant time lookups work under the hood.

Start Visualizing

Recursion

Base Case • Call Stack • Divide-Conquer • Backtrack • Memo • Tree

The art of solving a problem by solving smaller instances of itself.

Start Visualizing

Trees

BST • AVL • Inorder • Preorder • Postorder • Level Order

Navigate hierarchical data structures with recursive elegance.

Start Visualizing

Heaps

Min-Heap • Max-Heap • Insert • Heapify • Heap Sort • Top K

Efficiently manage priority data for scheduling and graph algorithms.

Start Visualizing

Tries

Prefix Tree • Autocomplete • Insert • Search • StartsWith • Delete

Optimize dictionary searches and prefix matching.

Start Visualizing

Graphs

BFS • DFS • Dijkstra • Shortest Path • Topo Sort • Cycle

Model real-world connections and find the shortest paths.

Start Visualizing

Greedy

Activity Selection • Huffman • Interval • Job Sequencing • Knapsack • Platforms

Make locally optimal choices to find a global optimum.

Start Visualizing

Dynamic Programming

Memoization • Tabulation • Fibonacci • Knapsack • LCS • Coin Change

Break down complex problems into overlapping subproblems.

Start Visualizing

Backtracking

N-Queens • Sudoku • Subsets • Permutations • Combination Sum • Maze

Explore all potential solutions by building candidates incrementally.

Start Visualizing

Bit Manipulation

AND • OR • XOR • Shifts • Masks • Power of Two • Subset Bits

Operate directly on binary data for extreme performance.

Start Visualizing

Sliding Window

Fixed • Dynamic • Max Sum • Min Size • Longest Substring • Anagrams

Efficiently process subarrays without re-computing.

Start Visualizing

Two Pointers

Collision • Parallel • Sort Colors • Container • Remove Duplicates • Triplet

Traverse data from multiple directions to reduce time complexity.

Start Visualizing