By Topic
- All Problems
- math (282)
- matrix-exponentiation (188)
- implementation (121)
- strings (103)
- combinatorics (93)
- dp (87)
- graphs (70)
- kmp (55)
- sorting (49)
- digit-dp (35)
- number-theory (34)
- prefix-sums (32)
- greedy (32)
- games (24)
- two-pointers (24)
- bitwise (23)
- binary-search (22)
- geometry (21)
- segment-tree (15)
- trees (15)
- bfs (14)
- aho-corasick (13)
- stack (11)
- sliding-window (10)
- game-theory (9)
- union-find (9)
- grundy (8)
- intervals (8)
- fenwick (7)
- heap (7)
- sparse-table (5)
- prefix-sum (5)
- interval-dp (5)
- suffix-array (4)
- linear-algebra (4)
- lazy-propagation (4)
- binary-lifting (4)
- bitmask (4)
- divide-and-conquer (4)
- offline (3)
- scc (3)
- shortest-paths (3)
- euler-tour (2)
- deque (2)
- manacher (2)
- mobius (2)
- nim (1)
- constructive (1)
- trie (1)
- sweep-line (1)
- brute-force (1)
- rerooting (1)
- pollard-rho (1)
- hashing (1)
- 2-sat (1)
- matching (1)
- knapsack (1)
- flow (1)
By Difficulty
Daily Challenge:
Paths Around the Walls
(1500)
Solve it to start a streak
bitwise Problems
23 practice problems tagged bitwise , from difficulty 800 to 2200 — solve them in our in-browser judge with instant verdicts. Browse all problems.
Related: math linear-algebra prefix-sums games brute-force trie digit-dp
| Problem | Topics | Solvers | Acceptance | Difficulty | |
|---|---|---|---|---|---|
| Check Bit K | bitwise | 1 |
100%
|
800 | |
| Flip Bit K | bitwise | 1 |
100%
|
800 | |
| Ones in Binary | math bitwise | 1 |
50%
|
900 | |
| Power of Two | math bitwise | 0 | — | 900 | |
| Lowest Set Bit | bitwise | 0 | — | 900 | |
| Largest Power of Two Within | math bitwise | 0 | — | 900 | |
| Flips to Convert | bitwise | 0 | — | 1100 | |
| Power of Four | math bitwise | 0 | — | 1100 | |
| The Lonely Number | bitwise | 0 | — | 1200 | |
| Mirror the Bits | bitwise | 0 | — | 1200 | |
| All Gray Codes | bitwise | 0 | — | 1200 | |
| XOR of 1..N | math bitwise | 0 | — | 1300 | |
| Swap Neighbouring Bits | bitwise | 25 |
44%
|
1300 | |
| N-th Gray Code | math bitwise | 1 |
100%
|
1300 | |
| Range XOR Queries | bitwise prefix-sums | 0 | — | 1300 | |
| Classic Nim | math bitwise games | 0 | — | 1500 | |
| Fairest Split | bitwise brute-force | 0 | — | 1500 | |
| Two Lonely Numbers | bitwise | 0 | — | 1600 | |
| Maximum XOR of a Pair | bitwise | 0 | — | 1800 | |
| Maximum XOR of a Subset | bitwise linear-algebra | 0 | — | 2000 | |
| Maximum XOR Subarray | bitwise trie | 0 | — | 2000 | |
| K-th Smallest XOR Value | bitwise linear-algebra | 0 | — | 2200 | |
| Bounded XOR Count | bitwise digit-dp | 0 | — | 2200 |