Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Practice Problems

Daily Challenge: Fewest Hops (1300) 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

ProblemTopics 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 2
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