Trie interview problem

#1

Can you please elaborate the question

#2

hello @bhattanurag426

u need to pick any two subarray (non overlapping ) such that sum of xor of both the subarray is maximum. u need to report this maximum value

#3

i am unable to solve this

#4

have ur solved max xor subarray problem ?

#5

got it sir …

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.