Hard

Hard | Array, Dynamic Programming, Memoization

Hard | Dynamic Programming, Memoization

Hard | Array, Dynamic Programming

Hard | Array, Bit Manipulation, Tree, Depth-First Search

Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix

Hard | Array, Stack, Union-Find, Monotonic Stack

Hard | Array, Math, Sorting, Heap (Priority Queue), Number Theory

Hard | Array, Hash Table, Greedy

Hard | Array, Hash Table, Binary Search, Bit Manipulation

Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort

Hard | Array, Math, Greedy

Hard | Math, Dynamic Programming

Hard | Array, Union-Find, Prefix Sum, Ordered Set

Hard | Array, Sorting, Heap (Priority Queue)

Hard | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation

Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue

Hard | Array, Greedy, Sorting

Hard | Array, String, Trie, Counting

Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sorting

Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set