Practice problems across 75+ categories
Practice problems frequently asked at Microsoft • 3344 problems | 831 Easy | 1747 Medium | 746 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 2506 | Partition Array Into Three Parts With Equal Sum | Easy | ArrayGreedy |
| 2507 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | ArrayTwo PointersBinary Search |
| 2508 | Partition Array into Two Equal Product Subsets | Medium | ArrayBit ManipulationRecursion |
| 2509 | Partition Array Such That Maximum Difference Is K | Medium | ArrayGreedySorting |
| 2510 | Partition Array to Minimize XOR | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 2511 | Partition Equal Subset Sum | Medium | ArrayDynamic Programming |
| 2512 | Partition Labels | Medium | Hash TableTwo PointersString |
| 2513 | Partition List | Medium | Linked ListTwo Pointers |
| 2514 | Partition String | Unknown | Hash TableStringTrie |
| 2515 | Partition String Into Minimum Beautiful Substrings | Medium | Hash TableStringDynamic Programming |
| 2516 | Partition String Into Substrings With Values at Most K | Medium | StringDynamic ProgrammingGreedy |
| 2517 | Partition to K Equal Sum Subsets | Medium | ArrayDynamic ProgrammingBacktracking |
| 2518 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | StringGreedy |
| 2519 | Pascal's Triangle | Easy | ArrayDynamic Programming |
| 2520 | Pascal's Triangle II | Easy | ArrayDynamic Programming |
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.
