Practice problems across 75+ categories
Practice problems frequently asked at Bit Manipulation • 249 problems | 48 Easy | 116 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 166 | Minimum Sum of Values by Dividing Array | Hard | ArrayBinary SearchDynamic Programming |
| 167 | Minimum Time to Break Locks I | Medium | ArrayDynamic ProgrammingBacktracking |
| 168 | Minimum Time to Kill All Monsters | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 169 | Minimum Time to Transport All Individuals | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 170 | Minimum Unique Word Abbreviation | Hard | ArrayStringBacktracking |
| 171 | Minimum XOR Sum of Two Arrays | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 172 | Missing Number | Easy | ArrayHash TableMath |
| 173 | Naming a Company | Hard | ArrayHash TableString |
| 174 | Neighboring Bitwise XOR | Medium | ArrayBit Manipulation |
| 175 | Non-decreasing Subsequences | Medium | ArrayHash TableBacktracking |
| 176 | Number Complement | Easy | Bit Manipulation |
| 177 | Number of 1 Bits | Easy | Divide and ConquerBit Manipulation |
| 178 | Number of Bit Changes to Make Two Integers Equal | Easy | Bit Manipulation |
| 179 | Number of Even and Odd Bits | Easy | Bit Manipulation |
| 180 | Number of Excellent Pairs | Hard | ArrayHash TableBinary 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.
