| Minimum Swaps to Avoid Forbidden Values | Open ↗ |
| Minimum Swaps to Group All 1's Together | Open ↗ |
| Minimum Swaps to Group All 1's Together II | Open ↗ |
| Minimum Swaps To Make Sequences Increasing | Open ↗ |
| Minimum Swaps to Make Strings Equal | Open ↗ |
| Minimum Swaps to Sort by Digit Sum | Open ↗ |
| Minimum Time Difference | Open ↗ |
| Minimum Time for K Connected Components | Open ↗ |
| Minimum Time to Activate String | Open ↗ |
| Minimum Time to Break Locks I | Open ↗ |
| Minimum Time to Break Locks II | Open ↗ |
| Minimum Time to Build Blocks | Open ↗ |
| Minimum Time to Collect All Apples in a Tree | Open ↗ |
| Minimum Time to Complete All Deliveries | Open ↗ |
| Minimum Time to Complete All Tasks | Open ↗ |
| Minimum Time to Complete Trips | Open ↗ |
| Minimum Time to Eat All Grains | Open ↗ |
| Minimum Time to Finish the Race | Open ↗ |
| Minimum Time to Kill All Monsters | Open ↗ |
| Minimum Time to Make Array Sum At Most x | Open ↗ |
| Minimum Time to Make Rope Colorful | Open ↗ |
| Minimum Time to Remove All Cars Containing Illegal Goods | Open ↗ |
| Minimum Time to Repair Cars | Open ↗ |
| Minimum Time to Revert Word to Initial State I | Open ↗ |
| Minimum Time to Revert Word to Initial State II | Open ↗ |
| Minimum Time to Type Word Using Special Typewriter | Open ↗ |
| Minimum Time to Visit a Cell In a Grid | Open ↗ |
| Minimum Time to Visit All Houses | Open ↗ |
| Minimum Time Visiting All Points | Open ↗ |
| Minimum Total Cost to Make Arrays Unequal | Open ↗ |
| Minimum Total Cost to Process All Elements | Open ↗ |
| Minimum Total Distance Traveled | Open ↗ |
| Minimum Total Space Wasted With K Resizing Operations | Open ↗ |
| Minimum Unique Word Abbreviation | Open ↗ |
| Minimum Value to Get Positive Step by Step Sum | Open ↗ |
| Minimum Weighted Subgraph With the Required Paths | Open ↗ |
| Minimum White Tiles After Covering With Carpets | Open ↗ |
| Minimum Window Subsequence | Open ↗ |
| Minimum Window Substring | Open ↗ |
| Minimum XOR Path in a Grid | Open ↗ |
| Minimum XOR Sum of Two Arrays | Open ↗ |
| Mini Parser | Open ↗ |
| Min Stack | Open ↗ |
| Mirror Distance of an Integer | Open ↗ |
| Mirror Reflection | Open ↗ |
| Missing Element in Sorted Array | Open ↗ |
| Missing Number | Open ↗ |
| Missing Number In Arithmetic Progression | Open ↗ |
| Missing Ranges | Open ↗ |
| Modify Graph Edge Weights | Open ↗ |
| Modify the Matrix | Open ↗ |
| Monotone Increasing Digits | Open ↗ |
| Monotonic Array | Open ↗ |
| Monthly Transactions I | Open ↗ |
| Monthly Transactions II | Open ↗ |
| Most Beautiful Item for Each Query | Open ↗ |
| Most Common Word | Open ↗ |
| Most Expensive Item That Can Not Be Bought | Open ↗ |
| Most Frequent Even Element | Open ↗ |
| Most Frequent IDs | Open ↗ |
| Most Frequent Number Following Key In an Array | Open ↗ |
| Most Frequent Prime | Open ↗ |
| Most Frequent Subtree Sum | Open ↗ |
| Most Popular Video Creator | Open ↗ |
| Most Profitable Path in a Tree | Open ↗ |
| Most Profit Assigning Work | Open ↗ |
| Most Stones Removed with Same Row or Column | Open ↗ |
| Most Visited Sector in a Circular Track | Open ↗ |
| Movement of Robots | Open ↗ |
| Move Pieces to Obtain a String | Open ↗ |
| Move Sub-Tree of N-Ary Tree | Open ↗ |
| Move Zeroes | Open ↗ |
| Movie Rating | Open ↗ |
| Moving Average from Data Stream | Open ↗ |
| Moving Stones Until Consecutive | Open ↗ |
| Moving Stones Until Consecutive II | Open ↗ |
| Multiply Strings | Open ↗ |
| My Calendar I | Open ↗ |
| My Calendar II | Open ↗ |
| My Calendar III | Open ↗ |
| Naming a Company | Open ↗ |
| N-ary Tree Level Order Traversal | Open ↗ |
| N-ary Tree Postorder Traversal | Open ↗ |
| N-ary Tree Preorder Traversal | Open ↗ |
| Nearest Exit from Entrance in Maze | Open ↗ |
| Neighboring Bitwise XOR | Open ↗ |
| Nested List Weight Sum | Open ↗ |
| Nested List Weight Sum II | Open ↗ |
| Network Delay Time | Open ↗ |
| Network Recovery Pathways | Open ↗ |
| New 21 Game | Open ↗ |
| New Users Daily Count | Open ↗ |
| Next Closest Time | Open ↗ |
| Next Greater Element I | Open ↗ |
| Next Greater Element II | Open ↗ |
| Next Greater Element III | Open ↗ |
| Next Greater Element IV | Open ↗ |
| Next Greater Node In Linked List | Open ↗ |
| Next Greater Numerically Balanced Number | Open ↗ |
| Next Palindrome Using Same Digits | Open ↗ |