Skip to content

Algorithm Usage

Problems organized by the algorithms they use. Click links to view solution code.

Dynamic Programming (38 problems)

Greedy (37 problems)

Dfs (36 problems)

Two Pointers (34 problems)

Bfs (27 problems)

Sorting (24 problems)

Binary Search (21 problems)

Backtracking (17 problems)

Monotonic Stack (14 problems)

Union Find (11 problems)

Prefix Sum (11 problems)

Sliding Window (9 problems)

Math (9 problems)

Recursion (9 problems)

Heap (8 problems)

Bit Manipulation (6 problems)

Enumeration (5 problems)

Trie Operations (5 problems)

Monotonic Deque (4 problems)

Kahns Algorithm (4 problems)

Simulation (4 problems)

Merge (4 problems)

Divide And Conquer (4 problems)

Counting (4 problems)

Dijkstra (4 problems)

Modular Arithmetic (3 problems)

Xor (2 problems)

Quickselect (2 problems)

Bucket Sort (2 problems)

Difference Array (2 problems)

Fenwick Tree (2 problems)

Segment Tree (2 problems)

Merge Sort (2 problems)

Linear Scan (2 problems)

Heap Operations (2 problems)

Tree Dp (2 problems)

0 1 Bfs (2 problems)

Bit Shifting (2 problems)

Dp (2 problems)

Topological Sort (2 problems)

Online Algorithm (1 problems)

Meet In The Middle (1 problems)

Bitmask (1 problems)

Factorization (1 problems)

Line Sweep (1 problems)

Deep Copy (1 problems)

Interweaving (1 problems)

Slow Fast (1 problems)

Reversal (1 problems)

Merge K Sorted (1 problems)

Hierholzer (1 problems)

Eulerian Path (1 problems)

Inclusion Exclusion (1 problems)

Bidirectional Search (1 problems)

Kadane (1 problems)

Expand Around Center (1 problems)

Manacher (1 problems)

Dfa (1 problems)

Sum Formula (1 problems)

Reverse (1 problems)

Sieve (1 problems)

Carry Propagation (1 problems)

Multiplication (1 problems)

Inorder (1 problems)

Range Deletion (1 problems)

String Parsing (1 problems)

Hashing (1 problems)

Gcd (1 problems)

Heap Optimization (1 problems)

Combinatorics (1 problems)

Cache Eviction (1 problems)

Inorder Traversal (1 problems)

Sweep Line (1 problems)

Bellman Ford (1 problems)

Coordinate Compression (1 problems)

Kernighan (1 problems)

Bit Iteration (1 problems)

Linked List (1 problems)

Modulo (1 problems)

Integer Division (1 problems)

Prefix Product (1 problems)

Masking (1 problems)

String Matching (1 problems)

Binary Exponentiation (1 problems)

Sequence Counting (1 problems)

Two Coloring (1 problems)

Memoization (1 problems)

Parsing (1 problems)

Encoding (1 problems)

Fast Exponentiation (1 problems)

Min Tracking (1 problems)

Stack Evaluation (1 problems)

Rabin Karp (1 problems)

State Machine (1 problems)

Transform (1 problems)

Prim (1 problems)

Kruskal (1 problems)

Rolling Hash (1 problems)

Minimax (1 problems)

Modular Inverse (1 problems)

Bst Traversal (1 problems)

Lca (1 problems)