Practice problems across 75+ categories
Practice problems frequently asked at Bitmask • 54 problems | 0 Easy | 17 Medium | 37 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Parallel Courses II | Hard | Dynamic ProgrammingBit ManipulationGraph |
| 47 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | ArrayTwo PointersBinary Search |
| 48 | Partition to K Equal Sum Subsets | Medium | ArrayDynamic ProgrammingBacktracking |
| 49 | Profile DP Grid Paths | Hard | Advanced DPDPBitmask |
| 50 | Select Cells in Grid With Maximum Score | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 51 | Shopping Offers | Medium | ArrayDynamic ProgrammingBacktracking |
| 52 | Shortest Path Visiting All Nodes | Hard | Dynamic ProgrammingBit ManipulationBreadth-First Search |
| 53 | Smallest Sufficient Team | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 54 | Special Permutations | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 55 | Split Array With Same Average | Hard | ArrayMathDynamic Programming |
| 56 | Stickers to Spell Word | Hard | ArrayHash TableString |
| 57 | The Number of Good Subsets | Hard | ArrayHash TableMath |
| 58 | Traveling Salesman (DP + Bitmask) | Hard | Advanced GraphsGraphDP |
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.
