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)