| Lowest Common Ancestor of a Binary Tree | Open ↗ |
| Lowest Common Ancestor of a Binary Tree II | Open ↗ |
| Lowest Common Ancestor of a Binary Tree III | Open ↗ |
| Lowest Common Ancestor of a Binary Tree IV | Open ↗ |
| Lowest Common Ancestor of Deepest Leaves | Open ↗ |
| LRU Cache | Open ↗ |
| Lucky Numbers in a Matrix | Open ↗ |
| Magical String | Open ↗ |
| Magic Squares In Grid | Open ↗ |
| Magnetic Force Between Two Balls | Open ↗ |
| Majority Element | Open ↗ |
| Majority Element II | Open ↗ |
| Make a Positive Array | Open ↗ |
| Make Array Elements Equal to Zero | Open ↗ |
| Make Array Empty | Open ↗ |
| Make Array Non-decreasing | Open ↗ |
| Make Array Non-decreasing or Non-increasing | Open ↗ |
| Make Array Zero by Subtracting Equal Amounts | Open ↗ |
| Make Costs of Paths Equal in a Binary Tree | Open ↗ |
| Make K-Subarray Sums Equal | Open ↗ |
| Make Lexicographically Smallest Array by Swapping Elements | Open ↗ |
| Make Number of Distinct Characters Equal | Open ↗ |
| Make String Anti-palindrome | Open ↗ |
| Make String a Subsequence Using Cyclic Increments | Open ↗ |
| Make Sum Divisible by P | Open ↗ |
| Make the Prefix Sum Non-negative | Open ↗ |
| Make The String Great | Open ↗ |
| Make the XOR of All Segments Equal to Zero | Open ↗ |
| Make Three Strings Equal | Open ↗ |
| Make Two Arrays Equal by Reversing Subarrays | Open ↗ |
| Making A Large Island | Open ↗ |
| Making File Names Unique | Open ↗ |
| Managers with at Least 5 Direct Reports | Open ↗ |
| Manhattan Distances of All Arrangements of Pieces | Open ↗ |
| Map of Highest Peak | Open ↗ |
| Map Sum Pairs | Open ↗ |
| Mark Elements on Array by Performing Queries | Open ↗ |
| Market Analysis I | Open ↗ |
| Market Analysis II | Open ↗ |
| Masking Personal Information | Open ↗ |
| Match Alphanumerical Pattern in Matrix I | Open ↗ |
| Matchsticks to Square | Open ↗ |
| Matrix Block Sum | Open ↗ |
| Matrix Cells in Distance Order | Open ↗ |
| Matrix Diagonal Sum | Open ↗ |
| Matrix Similarity After Cyclic Shifts | Open ↗ |
| Max Area of Island | Open ↗ |
| Max Chunks To Make Sorted | Open ↗ |
| Max Chunks To Make Sorted II | Open ↗ |
| Max Consecutive Ones | Open ↗ |
| Max Consecutive Ones II | Open ↗ |
| Max Consecutive Ones III | Open ↗ |
| Max Difference You Can Get From Changing an Integer | Open ↗ |
| Max Dot Product of Two Subsequences | Open ↗ |
| Maximal Network Rank | Open ↗ |
| Maximal Range That Each Element Is Maximum in It | Open ↗ |
| Maximal Rectangle | Open ↗ |
| Maximal Score After Applying K Operations | Open ↗ |
| Maximal Square | Open ↗ |
| Maximize Active Section with Trade I | Open ↗ |
| Maximize Active Section with Trade II | Open ↗ |
| Maximize Alternating Sum Using Swaps | Open ↗ |
| Maximize Amount After Two Days of Conversions | Open ↗ |
| Maximize Area of Square Hole in Grid | Open ↗ |
| Maximize Consecutive Elements in an Array After Modification | Open ↗ |
| Maximize Count of Distinct Primes After Split | Open ↗ |
| Maximize Cyclic Partition Score | Open ↗ |
| Maximize Distance to Closest Person | Open ↗ |
| Maximize Fixed Points After Deletions | Open ↗ |
| Maximize Greatness of an Array | Open ↗ |
| Maximize Grid Happiness | Open ↗ |
| Maximize Happiness of Selected Children | Open ↗ |
| Maximize Items | Open ↗ |
| Maximize Number of Nice Divisors | Open ↗ |
| Maximize Number of Subsequences in a String | Open ↗ |
| Maximize Palindrome Length From Subsequences | Open ↗ |
| Maximize Points After Choosing K Tasks | Open ↗ |
| Maximize Score After N Operations | Open ↗ |
| Maximize Score After Pair Deletions | Open ↗ |
| Maximize Score of Numbers in Ranges | Open ↗ |
| Maximize Spanning Tree Stability with Upgrades | Open ↗ |
| Maximize Subarray GCD Score | Open ↗ |
| Maximize Subarrays After Removing One Conflicting Pair | Open ↗ |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Open ↗ |
| Maximize Sum Of Array After K Negations | Open ↗ |
| Maximize Sum of Device Ratings | Open ↗ |
| Maximize Sum of Squares of Digits | Open ↗ |
| Maximize Sum of Weights after Edge Removals | Open ↗ |
| Maximize the Beauty of the Garden | Open ↗ |
| Maximize the Confusion of an Exam | Open ↗ |
| Maximize the Distance Between Points on a Square | Open ↗ |
| Maximize the Minimum Game Score | Open ↗ |
| Maximize the Minimum Powered City | Open ↗ |
| Maximize the Number of Partitions After Operations | Open ↗ |
| Maximize the Number of Target Nodes After Connecting Trees I | Open ↗ |
| Maximize the Number of Target Nodes After Connecting Trees II | Open ↗ |
| Maximize the Profit as the Salesman | Open ↗ |
| Maximize the Topmost Element After K Moves | Open ↗ |
| Maximize Total Cost of Alternating Subarrays | Open ↗ |
| Maximize Total Tastiness of Purchased Fruits | Open ↗ |