Practice problems across 75+ categories
Practice problems frequently asked at Microsoft • 3344 problems | 831 Easy | 1747 Medium | 746 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1636 | Maximize Score After N Operations | Hard | ArrayMathDynamic Programming |
| 1637 | Maximize Score After Pair Deletions | Medium | ArrayGreedy |
| 1638 | Maximize Score of Numbers in Ranges | Medium | ArrayBinary SearchGreedy |
| 1639 | Maximize Subarray GCD Score | Hard | ArrayMathEnumeration |
| 1640 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | ArrayDynamic ProgrammingSegment Tree |
| 1641 | Maximize Subarrays After Removing One Conflicting Pair | Hard | ArraySegment TreeEnumeration |
| 1642 | Maximize Sum Of Array After K Negations | Easy | ArrayGreedySorting |
| 1643 | Maximize Sum of Weights after Edge Removals | Hard | Dynamic ProgrammingTreeDepth-First Search |
| 1644 | Maximize the Beauty of the Garden | Hard | ArrayHash TableGreedy |
| 1645 | Maximize the Confusion of an Exam | Medium | StringBinary SearchSliding Window |
| 1646 | Maximize the Distance Between Points on a Square | Hard | ArrayBinary SearchGreedy |
| 1647 | Maximize the Minimum Game Score | Hard | ArrayBinary SearchGreedy |
| 1648 | Maximize the Minimum Powered City | Hard | ArrayBinary SearchGreedy |
| 1649 | Maximize the Number of Partitions After Operations | Hard | StringDynamic ProgrammingBit Manipulation |
| 1650 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | TreeDepth-First SearchBreadth-First Search |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
