Hard

Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set

Hard | Array, Dynamic Programming, Matrix

Hard | String, Depth-First Search, Graph Theory, Eulerian Circuit

Hard | Array, Greedy, Sorting

Hard | String, Divide and Conquer, Sorting

Hard | Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Array, Stack, Greedy, Sorting, Monotonic Stack

Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix

Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix

Hard | Math