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 > Maximum XOR Subarray > Editorial

Maximum XOR Subarray — Solution & Editorial

Back to the Problem

A subarray XOR is prefix[r] ⊕ prefix[l−1]. Insert prefix XORs into a binary trie and, for each prefix, greedily query the stored prefix that maximizes the XOR (take the opposite bit at each level).

Complexity: O(N · 30)