Maximum XOR of Two Non-Overlapping Subtrees |
Hard
|
|
|
Maximum XOR Score Subarray Queries |
Hard
|
|
|
Memoize II |
Hard
|
|
|
Merge BSTs to Create Single BST |
Hard
|
|
|
Minimize the Maximum Adjacent Element Difference |
Hard
|
|
|
Minimize the Total Price of the Trips |
Hard
|
|
|
Minimum Changes to Make K Semi-palindromes |
Hard
|
|
|
Minimum Cost to Change the Final Value of Expression |
Hard
|
|
|
Minimum Cost to Convert String II |
Hard
|
|
|
Minimum Degree of a Connected Trio in a Graph |
Hard
|
|
|
Minimum Edge Reversals So Every Node Is Reachable |
Hard
|
|
|
Minimum Money Required Before Transactions |
Hard
|
|
|
Minimum Moves to Move a Box to Their Target Location |
Hard
|
|
|
Minimum Moves to Pick K Ones |
Hard
|
|
|
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
Hard
|
airbnb
google
|
|
Minimum Number of Increments on Subarrays to Form a Target Array |
Hard
|
google
|
|
Minimum Number of K Consecutive Bit Flips |
Hard
|
akuna
akuna-capital
amazon
facebook
|
|
Minimum Operations to Form Subsequence With Target Sum |
Hard
|
|
|
Minimum Operations to Make the Array K-Increasing |
Hard
|
|
|
Minimum Operations to Remove Adjacent Ones in Matrix |
Hard
|
|
|
Minimum Relative Loss After Buying Chocolates |
Hard
|
|
|
Minimum Replacements to Sort the Array |
Hard
|
|
|
Minimum Reverse Operations |
Hard
|
|
|
Minimum Score After Removals on a Tree |
Hard
|
|
|
Minimum Time For K Virus Variants to Spread |
Hard
|
|
|
Minimum Time Takes to Reach Destination Without Drowning |
Hard
|
|
|
Minimum Time to Complete All Tasks |
Hard
|
|
|
Minimum Time to Revert Word to Initial State II |
Hard
|
|
|
Minimum Time to Visit a Cell In a Grid |
Hard
|
|
|
Minimum Window Subsequence |
Hard
|
amazon
bloomberg
ebay
google
houzz
microsoft
|
|
Number of Beautiful Integers in the Range |
Hard
|
|
|
Number of Different Subsequences GCDs |
Hard
|
|
|
Number of Great Partitions |
Hard
|
|
|
Number of Possible Sets of Closing Branches |
Hard
|
|
|
Number of Ships in a Rectangle |
Hard
|
bloomberg
|
|
Number of Subarrays That Match a Pattern II |
Hard
|
|
|
Number of Transactions per Visit |
Hard
|
machine-zone
machinezone
|
|
Number of Valid Subarrays |
Hard
|
hulu
|
|
Number of Visible People in a Queue |
Hard
|
|
|
Number of Ways to Earn Points |
Hard
|
|
|
Number of Ways to Reach Destination in the Grid |
Hard
|
|
|
Number Of Ways To Reconstruct A Tree |
Hard
|
|
|
Parse Lisp Expression |
Hard
|
affirm
google
|
|
Paths in Matrix Whose Sum Is Divisible by K |
Hard
|
|
|
Preimage Size of Factorial Zeroes Function |
Hard
|
adobe
|
|
Rank Transform of a Matrix |
Hard
|
|
|
Redundant Connection II |
Hard
|
google
|
|
Report Contiguous Dates |
Hard
|
facebook
|
|
Selling Pieces of Wood |
Hard
|
|
|
Set Intersection Size At Least Two |
Hard
|
drawbridge
uber
|
|