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

Maximum XOR Subarray

Difficulty: 2000 5000 ms 128 MB

bitwise trie

Print the maximum XOR of any contiguous subarray.

Input: the first line has N; the second line has N non-negative integers.

Output: the maximum subarray XOR.

Constraints:

  • 1 ≤ N ≤ 105
  • 0 ≤ ai < 230

Sample Tests

Input 1
3
1 2 3
Output 1
3
Input 2
2
8 8
Output 2
8

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen