AlgoVizLab
Playlists
AI Lab
Sign in
Two Pointers
O(n)
Pair Sum (Sorted Array)
Reverse Array In-Place
Deque — Push & Pop Both Ends
Cyclic Sort
Sliding Window
O(n)
Fixed Window — Max Sum
Longest Substring Without Repeats
Minimum Window Substring
Binary Search
O(log n)
Classic Binary Search
First & Last Occurrence
Search in Rotated Sorted Array
Binary Tree Traversal
O(n)
Inorder / Preorder / Postorder
Level Order (BFS)
BST — Insert & Search
Frequency Counting
O(n)
Valid Anagram
Majority Element
Matrix Traversal
O(rows × cols)
Spiral Order
Number of Islands
Flood Fill
Monotonic Stack
O(n)
Next Greater Element
Daily Temperatures
Prefix Sum
O(n) build, O(1) query
Range Sum Query (Immutable)
Subarray Sum Equals K
Overlapping Intervals
O(n log n)
Merge Intervals
Insert Interval
Greedy
O(n log n)
Activity Selection
Jump Game
Top K Elements
O(n log k)
Kth Largest Element
Top K Frequent Elements
Backtracking
O(exponential)
Subsets
Permutations
Depth-First Search
O(V + E)
Recursive DFS
Connected Components
Breadth-First Search
O(V + E)
Shortest Path (Unweighted)
Bipartite Check
Shortest Path (Weighted — Dijkstra)
Topological Sort
O(V + E)
Kahn's Algorithm (BFS)
Cycle Detection
O(V + E)
Directed Graph — DFS (3-Color)
Minimum Spanning Tree
O(E log V)
Prim's Algorithm
Dynamic Programming
varies
Fibonacci
Coin Change
Longest Common Subsequence
Kadane's Algorithm
Climbing Stairs
House Robber
Rod Cutting
Subset Sum
Unbounded Knapsack
0/1 Knapsack
Longest Increasing Subsequence
Edit Distance
Longest Palindromic Subsequence
Grid Paths (Unique Paths)
Interval DP (Burst Balloons)
Matrix Chain Multiplication
Bitmask DP (Traveling Salesman)
Digit DP
State Machine DP (Stock with Cooldown)
Union Find / DSU
O(α(n))
Path Compression + Union by Rank
Trie
O(L)
Insert & Search
Linked List
O(n)
Traversal — Sum & Search
Fast & Slow Pointers — Find the Middle
In-place Reversal
Bit Manipulation
O(n)
Single Number (XOR)
Tree DP
O(n)
House Robber III
Sign in
Home
Playlists
Two Pointers Fundamentals
1 pattern
Two Pointers Fundamentals
1 pattern · Updated 7/18/2026
TU
Test Playlist User
Play all
A quick tour through the two-pointers pattern family.
1
O(n)
Pair Sum (Sorted Array)
Two Pointers