| Minimum Number of Operations to Make Word K-Periodic | Open ↗ |
| Minimum Number of Operations to Make X and Y Equal | Open ↗ |
| Minimum Number of Operations to Move All Balls to Each Box | Open ↗ |
| Minimum Number of Operations to Reinitialize a Permutation | Open ↗ |
| Minimum Number of Operations to Satisfy Conditions | Open ↗ |
| Minimum Number of Operations to Sort a Binary Tree by Level | Open ↗ |
| Minimum Number of People to Teach | Open ↗ |
| Minimum Number of Primes to Sum to Target | Open ↗ |
| Minimum Number of Pushes to Type Word I | Open ↗ |
| Minimum Number of Pushes to Type Word II | Open ↗ |
| Minimum Number of Refueling Stops | Open ↗ |
| Minimum Number of Removals to Make Mountain Array | Open ↗ |
| Minimum Number of Seconds to Make Mountain Height Zero | Open ↗ |
| Minimum Number of Steps to Make Two Strings Anagram | Open ↗ |
| Minimum Number of Steps to Make Two Strings Anagram II | Open ↗ |
| Minimum Number of Swaps to Make the Binary String Alternating | Open ↗ |
| Minimum Number of Swaps to Make the String Balanced | Open ↗ |
| Minimum Number of Taps to Open to Water a Garden | Open ↗ |
| Minimum Number of Valid Strings to Form Target I | Open ↗ |
| Minimum Number of Vertices to Reach All Nodes | Open ↗ |
| Minimum Number of Visited Cells in a Grid | Open ↗ |
| Minimum Number of Work Sessions to Finish the Tasks | Open ↗ |
| Minimum Numbers of Function Calls to Make Target Array | Open ↗ |
| Minimum Obstacle Removal to Reach Corner | Open ↗ |
| Minimum One Bit Operations to Make Integers Zero | Open ↗ |
| Minimum Operations to Collect Elements | Open ↗ |
| Minimum Operations to Convert All Elements to Zero | Open ↗ |
| Minimum Operations to Convert Number | Open ↗ |
| Minimum Operations to Equalize Binary String | Open ↗ |
| Minimum Operations to Exceed Threshold Value I | Open ↗ |
| Minimum Operations to Exceed Threshold Value II | Open ↗ |
| Minimum Operations to Form Subsequence With Target Sum | Open ↗ |
| Minimum Operations to Halve Array Sum | Open ↗ |
| Minimum Operations to Make All Array Elements Equal | Open ↗ |
| Minimum Operations to Make Array Elements Zero | Open ↗ |
| Minimum Operations to Make Array Equal | Open ↗ |
| Minimum Operations to Make Array Equal II | Open ↗ |
| Minimum Operations to Make Array Equal to Target | Open ↗ |
| Minimum Operations to Make Array Non Decreasing | Open ↗ |
| Minimum Operations to Make Array Sum Divisible by K | Open ↗ |
| Minimum Operations to Make Array Values Equal to K | Open ↗ |
| Minimum Operations to Make a Subsequence | Open ↗ |
| Minimum Operations to Make a Uni-Value Grid | Open ↗ |
| Minimum Operations to Make Binary Array Elements Equal to One I | Open ↗ |
| Minimum Operations to Make Binary Array Elements Equal to One II | Open ↗ |
| Minimum Operations to Make Binary Palindrome | Open ↗ |
| Minimum Operations to Make Character Frequencies Equal | Open ↗ |
| Minimum Operations to Make Columns Strictly Increasing | Open ↗ |
| Minimum Operations to Make Median of Array Equal to K | Open ↗ |
| Minimum Operations to Make Numbers Non-positive | Open ↗ |
| Minimum Operations to Make the Array Alternating | Open ↗ |
| Minimum Operations to Make the Array Increasing | Open ↗ |
| Minimum Operations to Make the Array K-Increasing | Open ↗ |
| Minimum Operations to Make the Integer Zero | Open ↗ |
| Minimum Operations to Reduce an Integer to 0 | Open ↗ |
| Minimum Operations to Reduce X to Zero | Open ↗ |
| Minimum Operations to Remove Adjacent Ones in Matrix | Open ↗ |
| Minimum Operations to Sort a Permutation | Open ↗ |
| Minimum Operations to Sort a String | Open ↗ |
| Minimum Operations to Transform Array into Alternating Prime | Open ↗ |
| Minimum Operations to Write the Letter Y on a Grid | Open ↗ |
| Minimum Pair Removal to Sort Array I | Open ↗ |
| Minimum Pair Removal to Sort Array II | Open ↗ |
| Minimum Path Cost in a Grid | Open ↗ |
| Minimum Path Cost in a Hidden Grid | Open ↗ |
| Minimum Path Sum | Open ↗ |
| Minimum Penalty for a Shop | Open ↗ |
| Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Open ↗ |
| Minimum Processing Time | Open ↗ |
| Minimum Recolors to Get K Consecutive Black Blocks | Open ↗ |
| Minimum Rectangles to Cover Points | Open ↗ |
| Minimum Removals to Balance Array | Open ↗ |
| Minimum Remove to Make Valid Parentheses | Open ↗ |
| Minimum Replacements to Sort the Array | Open ↗ |
| Minimum Reverse Operations | Open ↗ |
| Minimum Right Shifts to Sort the Array | Open ↗ |
| Minimum Rounds to Complete All Tasks | Open ↗ |
| Minimum Runes to Add to Cast Spell | Open ↗ |
| Minimum Score After Removals on a Tree | Open ↗ |
| Minimum Score of a Path Between Two Cities | Open ↗ |
| Minimum Score Triangulation of Polygon | Open ↗ |
| Minimum Seconds to Equalize a Circular Array | Open ↗ |
| Minimum Sensors to Cover Grid | Open ↗ |
| Minimum Sideway Jumps | Open ↗ |
| Minimum Size Subarray in Infinite Array | Open ↗ |
| Minimum Size Subarray Sum | Open ↗ |
| Minimum Skips to Arrive at Meeting On Time | Open ↗ |
| Minimum Space Wasted From Packaging | Open ↗ |
| Minimum Speed to Arrive on Time | Open ↗ |
| Minimum Stability Factor of Array | Open ↗ |
| Minimum String Length After Removing Substrings | Open ↗ |
| Minimum Subarray Length With Distinct Sum At Least K | Open ↗ |
| Minimum Subsequence in Non-Increasing Order | Open ↗ |
| Minimum Substring Partition of Equal Character Frequency | Open ↗ |
| Minimum Suffix Flips | Open ↗ |
| Minimum Sum of Four Digit Number After Splitting Digits | Open ↗ |
| Minimum Sum of Mountain Triplets I | Open ↗ |
| Minimum Sum of Squared Difference | Open ↗ |
| Minimum Sum of Values by Dividing Array | Open ↗ |
| Minimum Swaps to Arrange a Binary Grid | Open ↗ |