Algorithm Studio

Select a pattern to visualize and learn step-by-step

24 Patterns

5 Easy

15 Medium

Use two pointers moving toward each other to find pairs that satisfy a condition in a sorted array.

5 examples:

LC 167: Two Sum II (Target 9)

Maintain a window of elements and slide it to find optimal subarrays.

5 examples:

LC 643: Max Subarray Sum (k=3)

Efficiently search in sorted data by eliminating half the search space.

5 examples:

LC 704: Binary Search

Breadth-First Search

Breadth-First Search

Explore graphs and trees level by level. Great for shortest path.

5 examples:

LC 102: Level Order Traversal

Depth-First Search

Depth-First Search

Explore as deep as possible before backtracking.

5 examples:

LC 94: Inorder Traversal

Dynamic Programming

Dynamic Programming

Break problems into overlapping subproblems and cache results.

5 examples:

LC 509: Fibonacci (n=8)

Explore all possible solutions by building incrementally and abandoning ("backtracking") when constraints are violated.

4 examples:

LC 46: Permutations [1,2,3]

Stack Operations

Stack Operations

LIFO data structure for parentheses, expression evaluation.

5 examples:

Heap / Priority Queue

Heap / Priority Queue

Efficiently get min/max elements. Top K problems.

5 examples:

LC 215: Kth Largest (k=2)

Precompute cumulative sums to answer range queries in O(1).

5 examples:

LC 560: Subarray Sum (k=2)

Fast/slow pointers for cycle detection, reversal, merging.

5 examples:

LC 141: Cycle Detection

Greedy Algorithm

Greedy Algorithm

Make locally optimal choices hoping for global optimum.

5 examples:

LC 122: Stock Trading

Bit Manipulation

Bit Manipulation

Use bitwise XOR, AND, OR for efficient solutions.

5 examples:

Single Number [2,2,1]

Merge Intervals

Merge Intervals

Sort intervals and merge overlapping ones. Key for scheduling problems.

5 examples:

Monotonic Stack

Monotonic Stack

Maintain a stack with elements in increasing/decreasing order for next greater/smaller problems.

5 examples:

LC 496: Next Greater Element I

HashMap & Frequency

HashMap & Frequency

Use hash maps for O(1) lookup, frequency counting, and grouping.

5 examples:

Graph Algorithms

Graph Algorithms

Advanced graph algorithms including topological sort, shortest paths, and MST.

5 examples:

LC 207: Course Schedule

Design Problems

Design Problems

System design problems like LRU Cache, LFU Cache, and data structure design.

5 examples:

LRU Basic Operations

Sorting Techniques

Sorting Techniques

Sorting-based solutions using custom comparators and sorted properties.

5 examples:

Tries (Prefix Trees)

Tries (Prefix Trees)

Tree-like data structure for efficient prefix-based string operations and autocomplete.

4 examples:

Insert and Search 'apple'

Math & Geometry

Math & Geometry

Mathematical operations including modular arithmetic, matrix operations, and computational geometry.

5 examples:

LC 54: Spiral Matrix

Union-Find (Disjoint Set)

Union-Find (Disjoint Set)

Efficiently track connected components and detect cycles using disjoint sets with path compression and union by rank.

5 examples:

LC 684: Redundant Connection

Efficiently answer range queries and updates in O(log n) time using a binary tree structure.

5 examples:

LC 307: Range Sum Query

Pattern Matching

Pattern Matching

Efficiently search for patterns in strings using KMP, Rabin-Karp, or wildcard matching algorithms.

5 examples:

LC 28: KMP Search