All Problems
Problem 1:
Longest Increasing Subsequence
Problem 2:
Convex Hull
Problem 3:
Matrix Exponentiation for Fibonacci Numbers
Problem 4:
Maximum Flow (Edmonds-Karp)
Problem 5:
Minimum Cost Flow
Problem 6:
Suffix Automaton
Problem 7:
2-SAT Problem
Problem 8:
Segment Tree with Lazy Propagation
Problem 9:
Fenwick Tree for Inversion Count
Problem 10:
0/1 Knapsack Problem
Problem 11:
Longest Common Subsequence
Problem 12:
Lowest Common Ancestor (Binary Lifting)
Problem 13:
Heavy-Light Decomposition
Problem 14:
Persistent Segment Tree
Problem 15:
Eulerian Path
Problem 16:
Tarjan's Strongly Connected Components
Problem 17:
Hungarian Algorithm for Assignment Problem
Problem 18:
Maximum Independent Set in a Tree
Problem 19:
Traveling Salesman Problem (Bitmask DP)
Problem 21:
Longest Path in a Tree
Problem 22:
Maximum Subarray Sum Modulo
Problem 23:
Minimum Adjacent Swaps to Group All Vowels
Problem 24:
Minimum Swaps for Bracket Sequence
Problem 25:
Road Construction
Problem 26:
Subsequence Queries
Problem 27:
Equal Sum Partition
Problem 28:
Permutations with Inversions
Problem 29:
Nim Game Variation
Problem 30:
Sum of Substrings
Problem 31:
Interleaving Strings
Problem 32:
Subarray Distinct Values
Problem 33:
Longest Valid Parentheses
Problem 34:
Robot Paths
Problem 35:
Subarray GCD 1
Problem 36:
Longest Increasing Subsequence
Problem 37:
Count Paths in DAG
Problem 38:
Dijkstra's Shortest Path
Problem 39:
Subarray Sum Equals K
Problem 40:
Palindrome Partitioning Minimum Cuts
Problem 41:
Coin Change Problem
Problem 42:
Longest Palindromic Substring
Problem 43:
Segment Tree Range Sum
Problem 44:
Range Update and Point Query (Fenwick Tree)
Problem 45:
Strongly Connected Components
Problem 46:
Suffix Array Construction
Problem 47:
Maximum Flow - Edmonds Karp
Problem 48:
Travelling Salesman Problem
Problem 49:
Union-Find Connected Components
Problem 50:
Lowest Common Ancestor in Tree using Binary Lifting