Maximum xor sum

Revision en1, by Usu, 2018-07-08 21:50:39

Hey guys, I am returning to you with a problem. Given n numbers a1 a2.. an, find the substring (some consecutive nummbers) with the maximum xor string.

I know that we must use a trie, but I don't really know how. Can anybody explain me please?

Tags trie, xor

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Usu 2018-07-08 21:50:39 264 Initial revision (published)