Hard

Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix

Hard | Dynamic Programming, Bit Manipulation, Memoization, Bitmask

Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory

Hard | Math, String, Dynamic Programming, Stack

Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree

Hard | Array, Heap (Priority Queue), Simulation

Hard | String, Dynamic Programming, Bit Manipulation, Bitmask

Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)

Hard | Array, Matrix, Enumeration

Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)

Hard | Math, String, Backtracking, Greedy, Number Theory

Hard | Array, Binary Search, Greedy

Hard | Array, Binary Search, Dynamic Programming, Sorting

Hard | String, Greedy, String Matching

Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree

Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum

Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search

Hard | Array, String, Divide and Conquer, Tree, Segment Tree

Hard | Array, Hash Table, String, Design, Trie

Hard | Hash Table, Math, String, Stack, Recursion