Practice problems across 75+ categories
Practice problems frequently asked at Bitmask • 54 problems | 0 Easy | 17 Medium | 37 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Minimum Incompatibility | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 32 | Minimum Increments for Target Multiples in an Array | Hard | ArrayMathDynamic Programming |
| 33 | Minimum Number of Lines to Cover Points | Medium | ArrayHash TableMath |
| 34 | Minimum Number of Work Sessions to Finish the Tasks | Medium | ArrayDynamic ProgrammingBacktracking |
| 35 | Minimum Time to Break Locks I | Medium | ArrayDynamic ProgrammingBacktracking |
| 36 | Minimum Time to Kill All Monsters | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 37 | Minimum Time to Transport All Individuals | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 38 | Minimum XOR Sum of Two Arrays | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 39 | Number of Self-Divisible Permutations | Medium | ArrayMathDynamic Programming |
| 40 | Number of Squareful Arrays | Hard | ArrayHash TableMath |
| 41 | Number of Ways to Build Sturdy Brick Wall | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 42 | Number of Ways to Wear Different Hats to Each Other | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 43 | Optimal Account Balancing | Hard | ArrayDynamic ProgrammingBacktracking |
| 44 | Parallel Courses II | Hard | Dynamic ProgrammingBit ManipulationGraph |
| 45 | Partition Array Into Two Arrays to Minimize Sum Difference | 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.
