Maximum XOR Subarray - Hashing

#1

Given an array of n integers, find subarray whose xor is maximum. A subarray is a contiguous part of array.

Only passing two testcases : https://ide.codingblocks.com/s/65473

#2

Hi Lakshay, I have corrected your code. Please check it now. I have also commented the mistakes at respective places. Your corrected code is this.
Hope this helps :slight_smile:

1 Like
#3

Hey Lakshay, as you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.