Maximum Size of a Set After Removals |
Medium
|
|
|
Maximum Split of Positive Even Integers |
Medium
|
|
|
Maximum Sum of Almost Unique Subarray |
Medium
|
|
|
Maximum Sum of Two Non-Overlapping Subarrays |
Medium
|
amazon
facebook
google
snapchat
|
|
Maximum Total Reward Using Operations I |
Medium
|
|
|
Maximum Twin Sum of a Linked List |
Medium
|
|
|
Maximum Value after Insertion |
Medium
|
|
|
Maximum White Tiles Covered by a Carpet |
Medium
|
|
|
Maximum Xor Product |
Medium
|
|
|
Memoize |
Medium
|
|
|
Merge In Between Linked Lists |
Medium
|
|
|
Mice and Cheese |
Medium
|
|
|
Minesweeper |
Medium
|
amazon
bloomberg
cruise-automation
facebook
google
liveramp
microsoft
oracle
uber
|
|
Minimize Hamming Distance After Swap Operations |
Medium
|
|
|
Minimize Maximum Pair Sum in Array |
Medium
|
|
|
Minimize the Maximum of Two Arrays |
Medium
|
|
|
Minimum Absolute Difference Queries |
Medium
|
|
|
Minimum Absolute Sum Difference |
Medium
|
|
|
Minimum Addition to Make Integer Beautiful |
Medium
|
|
|
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
Medium
|
|
|
Minimum Area Rectangle |
Medium
|
amazon
facebook
goldman-sachs
google
microsoft
nvidia
|
|
Minimum Array Sum |
Medium
|
|
|
Minimum Average Difference |
Medium
|
|
|
Minimum Cost Homecoming of a Robot in a Grid |
Medium
|
|
|
Minimum Cost to Make All Characters Equal |
Medium
|
|
|
Minimum Cost to Make Array Equalindromic |
Medium
|
|
|
Minimum Cost to Set Cooking Time |
Medium
|
|
|
Minimum Deletions to Make Array Beautiful |
Medium
|
|
|
Minimum Division Operations to Make Array Non Decreasing |
Medium
|
|
|
Minimum Impossible OR |
Medium
|
|
|
Minimum Jumps to Reach Home |
Medium
|
|
|
Minimum Length of String After Deleting Similar Ends |
Medium
|
|
|
Minimum Non-Zero Product of the Array Elements |
Medium
|
|
|
Minimum Number of Frogs Croaking |
Medium
|
c3ai
|
|
Minimum Number of Operations to Make All Array Elements Equal to 1 |
Medium
|
|
|
Minimum Number of Operations to Make Array Empty |
Medium
|
|
|
Minimum Number of Operations to Make X and Y Equal |
Medium
|
|
|
Minimum Number of Operations to Satisfy Conditions |
Medium
|
|
|
Minimum Number of People to Teach |
Medium
|
|
|
Minimum Number of Work Sessions to Finish the Tasks |
Medium
|
|
|
Minimum Numbers of Function Calls to Make Target Array |
Medium
|
|
|
Minimum Operations to Make a Special Number |
Medium
|
|
|
Minimum Operations to Make All Array Elements Equal |
Medium
|
|
|
Minimum Operations to Make Array Equal II |
Medium
|
|
|
Minimum Operations to Make Binary Array Elements Equal to One II |
Medium
|
|
|
Minimum Operations to Make Median of Array Equal to K |
Medium
|
|
|
Minimum Operations to Make the Array Alternating |
Medium
|
|
|
Minimum Operations to Maximize Last Elements in Arrays |
Medium
|
|
|
Minimum Path Cost in a Grid |
Medium
|
|
|
Minimum Processing Time |
Medium
|
|
|