Practice problems across 75+ categories
Practice problems frequently asked at Bitmask • 54 problems | 0 Easy | 17 Medium | 37 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 16 | Matchsticks to Square | Medium | ArrayDynamic ProgrammingBacktracking |
| 17 | Maximize Grid Happiness | Hard | Dynamic ProgrammingBit ManipulationMemoization |
| 18 | Maximize Score After N Operations | Hard | ArrayMathDynamic Programming |
| 19 | Maximize the Number of Partitions After Operations | Hard | StringDynamic ProgrammingBit Manipulation |
| 20 | Maximum AND Sum of Array | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 21 | Maximum Compatibility Score Sum | Medium | ArrayDynamic ProgrammingBacktracking |
| 22 | Maximum Cost of Trip With K Highways | Hard | Dynamic ProgrammingBit ManipulationGraph |
| 23 | Maximum Good Subtree Score | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 24 | Maximum Number of Groups Getting Fresh Donuts | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 25 | Maximum Number of Moves to Kill All Pawns | Hard | ArrayMathBit Manipulation |
| 26 | Maximum Product of the Length of Two Palindromic Subsequences | Medium | StringDynamic ProgrammingBacktracking |
| 27 | Maximum Profit from Valid Topological Order in DAG | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 28 | Maximum Score Words Formed by Letters | Hard | ArrayHash TableString |
| 29 | Maximum Students Taking Exam | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 30 | Minimum Cost to Connect Two Groups of Points | Hard | ArrayDynamic ProgrammingBit Manipulation |
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.
