Python 3 wrong answer

#1

code link: https://ideone.com/mFNuE5

#2

your code fails for larger test cases .use tries instead

#3

Your answer doesn’t help in any way. It is obvious that we have to use tries, as this challenge belongs to topic Trie. Why don’t you point out where my source code logic (thought process) is wrong and guide me in right direction i.e. help me understand how it can be solved using Tries (intuition).

#4

see, i can hep you in java or c++ ,i’m not proficient in python.
i can help your with the approach
what u need to do is u need to iterate to each index i and then simply find
max xor subarray in [0,i] and [i+1,n-1] , add both sum check if it greater than ur previous sum , if it is then update ur sum.