Maximum Genetic Difference Query HARD Array Hash Table Bit Manipulation Depth-First Search Trie
Minimum Total Space Wasted With K Resizing Operations MEDIUM Array Dynamic Programming Prefix Sum
Trapping Rain Water HARD Array Two Pointers Dynamic Programming Stack Monotonic Stack
Minimum Cost to Buy Apples MEDIUM Array Graph Theory Heap (Priority Queue) Shortest Path
Maximum XOR of Two Non-Overlapping Subtrees HARD Tree Depth-First Search Graph Theory Trie
Difference Between Maximum and Minimum Price Sum HARD Array Dynamic Programming Tree Depth-First Search
Sum of Remoteness of All Cells MEDIUM Array Hash Table Depth-First Search Breadth-First Search Union-Find Matrix
Maximum Value of an Ordered Triplet II MEDIUM Array
Maximum Value of an Ordered Triplet I EASY Array
LRU Cache MEDIUM Hash Table Linked List Design Doubly-Linked List
Count the Number of Square-Free Subsets MEDIUM Array Math Dynamic Programming Bit Manipulation Number Theory Bitmask
Furthest Building You Can Reach MEDIUM Array Greedy Heap (Priority Queue)
Queens That Can Attack the King MEDIUM Array Matrix Simulation
Minimum Time Visiting All Points EASY Array Math Geometry
Make the XOR of All Segments Equal to Zero HARD Array Hash Table Dynamic Programming Bit Manipulation Counting
Minimum XOR Sum of Two Arrays HARD Array Dynamic Programming Bit Manipulation Bitmask
Minimum Operations to Form Subsequence With Target Sum HARD Array Greedy Bit Manipulation
Maximum Segment Sum After Removals HARD Array Union-Find Prefix Sum Ordered Set
Trapping Rain Water II HARD Array Breadth-First Search Heap (Priority Queue) Matrix
Time Needed to Inform All Employees MEDIUM Tree Depth-First Search Breadth-First Search
