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
Problem of the Day:
Integer Square Root
— keep your streak alive!
Practice Problems — bitwise
| # | Problem | Topics | Difficulty |
|---|---|---|---|
| 432 | Check Bit K | bitwise | 800 |
| 433 | Flip Bit K | bitwise | 800 |
| 27 | Ones in Binary | math bitwise | 900 |
| 226 | Power of Two | math bitwise | 900 |
| 430 | Lowest Set Bit | bitwise | 900 |
| 431 | Largest Power of Two Within | math bitwise | 900 |
| 225 | Flips to Convert | bitwise | 1100 |
| 434 | Power of Four | math bitwise | 1100 |
| 223 | The Lonely Number | bitwise | 1200 |
| 435 | Mirror the Bits | bitwise | 1200 |
| 459 | All Gray Codes | bitwise | 1200 |
| 181 | XOR of 1..N | math bitwise | 1300 |
| 228 | Swap Neighbouring Bits | bitwise | 1300 |
| 229 | N-th Gray Code | math bitwise | 1300 |
| 266 | Range XOR Queries | bitwise prefix-sums | 1300 |
| 281 | Classic Nim | math bitwise games | 1500 |
| 457 | Fairest Split | bitwise brute-force | 1500 |
| 224 | Two Lonely Numbers | bitwise | 1600 |
| 227 | Maximum XOR of a Pair | bitwise | 1800 |
| 576 | Maximum XOR of a Subset | bitwise linear-algebra | 2000 |
| 622 | Maximum XOR Subarray | bitwise trie | 2000 |
| 577 | K-th Smallest XOR Value | bitwise linear-algebra | 2200 |
| 860 | Bounded XOR Count | bitwise digit-dp | 2200 |