Practice problems across 75+ categories
Practice problems frequently asked at Array • 1947 problems | 398 Easy | 1049 Medium | 497 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1501 | Partition Array According to Given Pivot | Medium | ArrayTwo PointersSimulation |
| 1502 | Partition Array for Maximum Sum | Medium | ArrayDynamic Programming |
| 1503 | Partition Array into Disjoint Intervals | Medium | Array |
| 1504 | Partition Array Into Three Parts With Equal Sum | Easy | ArrayGreedy |
| 1505 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | ArrayTwo PointersBinary Search |
| 1506 | Partition Array into Two Equal Product Subsets | Medium | ArrayBit ManipulationRecursion |
| 1507 | Partition Array Such That Maximum Difference Is K | Medium | ArrayGreedySorting |
| 1508 | Partition Array to Minimize XOR | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 1509 | Partition Equal Subset Sum | Medium | ArrayDynamic Programming |
| 1510 | Partition to K Equal Sum Subsets | Medium | ArrayDynamic ProgrammingBacktracking |
| 1511 | Pascal's Triangle | Easy | ArrayDynamic Programming |
| 1512 | Pascal's Triangle II | Easy | ArrayDynamic Programming |
| 1513 | Patching Array | Hard | ArrayGreedy |
| 1514 | Path Existence Queries in a Graph I | Medium | ArrayHash TableBinary Search |
| 1515 | Path Existence Queries in a Graph II | Hard | ArrayTwo PointersBinary 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.
