| Minimum Deletions to Make Array Divisible | Open ↗ |
| Minimum Deletions to Make Character Frequencies Unique | Open ↗ |
| Minimum Deletions to Make String Balanced | Open ↗ |
| Minimum Deletions to Make String K-Special | Open ↗ |
| Minimum Depth of Binary Tree | Open ↗ |
| Minimum Difference Between Highest and Lowest of K Scores | Open ↗ |
| Minimum Difference Between Largest and Smallest Value in Three Moves | Open ↗ |
| Minimum Difference in Sums After Removal of Elements | Open ↗ |
| Minimum Difficulty of a Job Schedule | Open ↗ |
| Minimum Distance Between BST Nodes | Open ↗ |
| Minimum Distance Between Three Equal Elements I | Open ↗ |
| Minimum Distance Between Three Equal Elements II | Open ↗ |
| Minimum Distance to the Target Element | Open ↗ |
| Minimum Distance to Type a Word Using Two Fingers | Open ↗ |
| Minimum Division Operations to Make Array Non Decreasing | Open ↗ |
| Minimum Domino Rotations For Equal Row | Open ↗ |
| Minimum Edge Reversals So Every Node Is Reachable | Open ↗ |
| Minimum Edge Weight Equilibrium Queries in a Tree | Open ↗ |
| Minimum Element After Replacement With Digit Sum | Open ↗ |
| Minimum Elements to Add to Form a Given Sum | Open ↗ |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Open ↗ |
| Minimum Factorization | Open ↗ |
| Minimum Falling Path Sum | Open ↗ |
| Minimum Falling Path Sum II | Open ↗ |
| Minimum Flips in Binary Tree to Get Result | Open ↗ |
| Minimum Flips to Make a OR b Equal to c | Open ↗ |
| Minimum Flips to Make Binary String Coherent | Open ↗ |
| Minimum Fuel Cost to Report to the Capital | Open ↗ |
| Minimum Garden Perimeter to Collect Enough Apples | Open ↗ |
| Minimum Genetic Mutation | Open ↗ |
| Minimum Health to Beat Game | Open ↗ |
| Minimum Height Trees | Open ↗ |
| Minimum Hours of Training to Win a Competition | Open ↗ |
| Minimum Impossible OR | Open ↗ |
| Minimum Incompatibility | Open ↗ |
| Minimum Increase to Maximize Special Indices | Open ↗ |
| Minimum Increment Operations to Make Array Beautiful | Open ↗ |
| Minimum Increments to Equalize Leaf Paths | Open ↗ |
| Minimum Increment to Make Array Unique | Open ↗ |
| Minimum Index of a Valid Split | Open ↗ |
| Minimum Index Sum of Two Lists | Open ↗ |
| Minimum Initial Energy to Finish Tasks | Open ↗ |
| Minimum Insertion Steps to Make a String Palindrome | Open ↗ |
| Minimum Insertions to Balance a Parentheses String | Open ↗ |
| Minimum Interval to Include Each Query | Open ↗ |
| Minimum Jumps to Reach End via Prime Teleportation | Open ↗ |
| Minimum Jumps to Reach Home | Open ↗ |
| Minimum Knight Moves | Open ↗ |
| Minimum K to Reduce Array Within Limit | Open ↗ |
| Minimum Length of Anagram Concatenation | Open ↗ |
| Minimum Length of String After Deleting Similar Ends | Open ↗ |
| Minimum Length of String After Operations | Open ↗ |
| Minimum Levels to Gain More Points | Open ↗ |
| Minimum Limit of Balls in a Bag | Open ↗ |
| Minimum Lines to Represent a Line Chart | Open ↗ |
| Minimum Money Required Before Transactions | Open ↗ |
| Minimum Moves to Balance Circular Array | Open ↗ |
| Minimum Moves to Capture The Queen | Open ↗ |
| Minimum Moves to Clean the Classroom | Open ↗ |
| Minimum Moves to Convert String | Open ↗ |
| Minimum Moves to Equal Array Elements | Open ↗ |
| Minimum Moves to Equal Array Elements II | Open ↗ |
| Minimum Moves to Equal Array Elements III | Open ↗ |
| Minimum Moves to Make Array Complementary | Open ↗ |
| Minimum Moves to Move a Box to Their Target Location | Open ↗ |
| Minimum Moves to Pick K Ones | Open ↗ |
| Minimum Moves to Reach Target in Grid | Open ↗ |
| Minimum Moves to Reach Target Score | Open ↗ |
| Minimum Moves to Reach Target with Rotations | Open ↗ |
| Minimum Moves to Spread Stones Over Grid | Open ↗ |
| Minimum Non-Zero Product of the Array Elements | Open ↗ |
| Minimum Number Game | Open ↗ |
| Minimum Number of Arrows to Burst Balloons | Open ↗ |
| Minimum Number of Chairs in a Waiting Room | Open ↗ |
| Minimum Number of Changes to Make Binary String Beautiful | Open ↗ |
| Minimum Number of Coins to be Added | Open ↗ |
| Minimum Number of Days to Disconnect Island | Open ↗ |
| Minimum Number of Days to Eat N Oranges | Open ↗ |
| Minimum Number of Days to Make m Bouquets | Open ↗ |
| Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Open ↗ |
| Minimum Number of Flips to Make Binary Grid Palindromic II | Open ↗ |
| Minimum Number of Flips to Make the Binary String Alternating | Open ↗ |
| Minimum Number of Food Buckets to Feed the Hamsters | Open ↗ |
| Minimum Number of Frogs Croaking | Open ↗ |
| Minimum Number of Groups to Create a Valid Assignment | Open ↗ |
| Minimum Number of Increments on Subarrays to Form a Target Array | Open ↗ |
| Minimum Number of K Consecutive Bit Flips | Open ↗ |
| Minimum Number of Keypresses | Open ↗ |
| Minimum Number of Lines to Cover Points | Open ↗ |
| Minimum Number of Moves to Make Palindrome | Open ↗ |
| Minimum Number of Moves to Seat Everyone | Open ↗ |
| Minimum Number of Operations to Convert Time | Open ↗ |
| Minimum Number of Operations to Have Distinct Elements | Open ↗ |
| Minimum Number of Operations to Make All Array Elements Equal to 1 | Open ↗ |
| Minimum Number of Operations to Make Array Continuous | Open ↗ |
| Minimum Number of Operations to Make Array Empty | Open ↗ |
| Minimum Number of Operations to Make Arrays Similar | Open ↗ |
| Minimum Number of Operations to Make Array XOR Equal to K | Open ↗ |
| Minimum Number of Operations to Make Elements in Array Distinct | Open ↗ |
| Minimum Number of Operations to Make String Sorted | Open ↗ |