| Lexicographically Smallest Beautiful String |
Hard
|
|
|
| Lexicographically Smallest String After Applying Operations |
Medium
|
|
|
| Lexicographically Smallest String After Substring Operation |
Medium
|
|
|
| Linked List Frequency |
Easy
|
|
|
| Logical OR of Two Binary Grids Represented as Quad-Trees |
Medium
|
amazon
google
sumologic
|
|
| Lonely Pixel II |
Medium
|
google
|
|
| Long Pressed Name |
Easy
|
google
|
|
| Longer Contiguous Segments of Ones than Zeros |
Easy
|
|
|
| Longest Alternating Subarray |
Easy
|
|
|
| Longest Common Subsequence Between Sorted Arrays |
Medium
|
|
|
| Longest Common Suffix Queries |
Hard
|
|
|
| Longest Palindromic Subsequence II |
Medium
|
|
|
| Longest Repeating Substring |
Medium
|
amazon
facebook
google
microsoft
|
|
| Longest Substring Of All Vowels in Order |
Medium
|
|
|
| Longest Uncommon Subsequence I |
Easy
|
google
|
|
| Longest Winning Streak |
Hard
|
|
|
| Longest Word in Dictionary |
Medium
|
amazon
goldman-sachs
google
pinterest
|
|
| Make Array Elements Equal to Zero |
Easy
|
|
|
| Make Array Empty |
Hard
|
|
|
| Make Array Non-decreasing or Non-increasing |
Hard
|
|
|
| Make Costs of Paths Equal in a Binary Tree |
Medium
|
|
|
| Make K-Subarray Sums Equal |
Medium
|
|
|
| Make Number of Distinct Characters Equal |
Medium
|
|
|
| Make String Anti-palindrome |
Hard
|
|
|
| Make the XOR of All Segments Equal to Zero |
Hard
|
|
|
| Making File Names Unique |
Medium
|
|
|
| Market Analysis I |
Medium
|
poshmark
|
|
| Market Analysis III |
Medium
|
|
|
| Masking Personal Information |
Medium
|
twitter
|
|
| Matrix Cells in Distance Order |
Easy
|
yahoo
|
|
| Matrix Similarity After Cyclic Shifts |
Easy
|
|
|
| Max Consecutive Ones |
Easy
|
amazon
google
microsoft
|
|
| Max Consecutive Ones II |
Medium
|
google
yandex
|
|
| Max Consecutive Ones III |
Medium
|
amazon
facebook
microsoft
yandex
|
|
| Maximize Area of Square Hole in Grid |
Medium
|
|
|
| Maximize Distance to Closest Person |
Medium
|
amazon
google
|
|
| Maximize Greatness of an Array |
Medium
|
|
|
| Maximize Items |
Hard
|
|
|
| Maximize Number of Nice Divisors |
Hard
|
|
|
| Maximize Sum Of Array After K Negations |
Easy
|
amazon
druva
|
|
| Maximize Sum of Weights after Edge Removals |
Hard
|
|
|
| Maximize the Number of Partitions After Operations |
Hard
|
|
|
| Maximize the Profit as the Salesman |
Medium
|
|
|
| Maximize the Topmost Element After K Moves |
Medium
|
|
|
| Maximize Total Cost of Alternating Subarrays |
Medium
|
|
|
| Maximize Value of Function in a Ball Passing Game |
Hard
|
|
|
| Maximum Average Subarray I |
Easy
|
google
microsoft
|
|
| Maximum Average Subarray II |
Hard
|
google
|
|
| Maximum Average Subtree |
Medium
|
amazon
atlassian
|
|
| Maximum Binary String After Change |
Medium
|
|
|