Google - Bitmask
Bitmask questions asked by Google
Total: 31
Easy: 4
Medium: 20
Hard: 7
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimum Operations to Transform Array into Alternating Prime | Visit | Medium | |
| 2 | Construct Uniform Parity Array I | Visit | Easy | |
| 3 | Count the Number of Good Subarrays | Visit | Medium | |
| 4 | Minimum Score After Removals on a Tree | Visit | Hard | |
| 5 | Minimum Cost to Set Cooking Time | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 31 questions for free!
Log In