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

Problems > K-th Smallest XOR Value > Editorial

K-th Smallest XOR Value — Solution & Editorial

Back to the Problem

Reduce the linear basis to canonical form (each pivot bit isolated). The 2rank distinct values are then in bijection with rank-bit numbers ordered by magnitude: the K−1 binary mask selects basis vectors.

Complexity: O(N · bits + rank2)

Watch out: Whether 0 counts as achievable when the basis is smaller than N (a dependency exists) shifts the entire ranking.