Maximum Strength of a Group |
Medium
|
|
|
Maximum Strong Pair XOR II |
Hard
|
|
|
Maximum Subarray Sum After One Operation |
Medium
|
|
|
Maximum Subtree of the Same Color |
Medium
|
|
|
Maximum Sum Obtained of Any Permutation |
Medium
|
|
|
Maximum Sum of an Hourglass |
Medium
|
|
|
Maximum Sum Queries |
Hard
|
|
|
Maximum Sum With Exactly K Elements |
Easy
|
|
|
Maximum Total Beauty of the Gardens |
Hard
|
|
|
Maximum Total Damage With Spell Casting |
Medium
|
|
|
Maximum Trailing Zeros in a Cornered Path |
Medium
|
|
|
Maximum Vacation Days |
Hard
|
facebook
google
microsoft
uber
|
|
Maximum Value Sum by Placing Three Rooks I |
Hard
|
|
|
Maximum XOR After Operations |
Medium
|
|
|
Maximum XOR of Two Non-Overlapping Subtrees |
Hard
|
|
|
Maximum XOR Score Subarray Queries |
Hard
|
|
|
Mean of Array After Removing Some Elements |
Easy
|
|
|
Median of a Row Wise Sorted Matrix |
Medium
|
|
|
Memoize II |
Hard
|
|
|
Merge BSTs to Create Single BST |
Hard
|
|
|
Merge Similar Items |
Easy
|
|
|
Merge Strings Alternately |
Easy
|
|
|
Min Max Game |
Easy
|
|
|
Minimize Length of Array Using Operations |
Medium
|
|
|
Minimize Result by Adding Parentheses to Expression |
Medium
|
|
|
Minimize Rounding Error to Meet Target |
Medium
|
airbnb
|
|
Minimize String Length |
Easy
|
|
|
Minimize the Difference Between Target and Chosen Elements |
Medium
|
|
|
Minimize the Maximum Adjacent Element Difference |
Hard
|
|
|
Minimize the Total Price of the Trips |
Hard
|
|
|
Minimizing Array After Replacing Pairs With Their Product |
Medium
|
|
|
Minimum Absolute Difference Between Elements With Constraint |
Medium
|
|
|
Minimum Additions to Make Valid String |
Medium
|
|
|
Minimum Area Rectangle II |
Medium
|
amazon
facebook
google
|
|
Minimum Array Changes to Make Differences Equal |
Medium
|
|
|
Minimum Array Length After Pair Removals |
Medium
|
|
|
Minimum Changes To Make Alternating Binary String |
Easy
|
|
|
Minimum Changes to Make K Semi-palindromes |
Hard
|
|
|
Minimum Consecutive Cards to Pick Up |
Medium
|
|
|
Minimum Cost for Cutting Cake I |
Medium
|
|
|
Minimum Cost of a Path With Special Roads |
Medium
|
|
|
Minimum Cost of Buying Candies With Discount |
Easy
|
|
|
Minimum Cost to Change the Final Value of Expression |
Hard
|
|
|
Minimum Cost to Connect Sticks |
Medium
|
amazon
google
|
|
Minimum Cost to Convert String II |
Hard
|
|
|
Minimum Cuts to Divide a Circle |
Easy
|
|
|
Minimum Degree of a Connected Trio in a Graph |
Hard
|
|
|
Minimum Edge Reversals So Every Node Is Reachable |
Hard
|
|
|
Minimum Element After Replacement With Digit Sum |
Easy
|
|
|
Minimum Elements to Add to Form a Given Sum |
Medium
|
|
|