Practice problems across 75+ categories
Practice problems frequently asked at Bit Manipulation • 249 problems | 48 Easy | 116 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 196 | Optimal Account Balancing | Hard | ArrayDynamic ProgrammingBacktracking |
| 197 | Palindrome Permutation | Easy | Hash TableStringBit Manipulation |
| 198 | Parallel Courses II | Hard | Dynamic ProgrammingBit ManipulationGraph |
| 199 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | ArrayTwo PointersBinary Search |
| 200 | Partition Array into Two Equal Product Subsets | Medium | ArrayBit ManipulationRecursion |
| 201 | Partition Array to Minimize XOR | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 202 | Partition to K Equal Sum Subsets | Medium | ArrayDynamic ProgrammingBacktracking |
| 203 | Path Existence Queries in a Graph II | Hard | ArrayTwo PointersBinary Search |
| 204 | Power of Four | Easy | MathBit ManipulationRecursion |
| 205 | Power of Two | Easy | MathBit ManipulationRecursion |
| 206 | Prime Number of Set Bits in Binary Representation | Easy | MathBit Manipulation |
| 207 | Prison Cells After N Days | Medium | ArrayHash TableMath |
| 208 | Pseudo-Palindromic Paths in a Binary Tree | Medium | Bit ManipulationTreeDepth-First Search |
| 209 | Pyramid Transition Matrix | Medium | Hash TableStringBacktracking |
| 210 | Range Product Queries of Powers | Medium | ArrayBit ManipulationPrefix Sum |
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.
