kuchh to thoda thoda samjh me aya hai... But ye nhi samjh aya ki kya samjh aya hai... However, i learnt the concept of subarray, subsequence, truth table of XOR, prefix sum array, etc. So Thank you sir. Yes, I don`t get the code to implement query part.
41 minutes of lecture, after prefix xor there is nothing, a total waste of my time. Just tell after prefix xor how you are getting the inner sub array's xor and getting there xor also
Xor is it's own inverse operation, just like how in prefix sums you do sum[a...b] = sum[b] - sum[a-1], you can do xor[a...b] = xor[b] ^ xor[a-1]. By the way, there's no need to be rude.
good to go.
kuchh to thoda thoda samjh me aya hai...
But ye nhi samjh aya ki kya samjh aya hai...
However, i learnt the concept of subarray, subsequence, truth table of XOR, prefix sum array, etc. So Thank you sir.
Yes, I don`t get the code to implement query part.
41 minutes of lecture, after prefix xor there is nothing, a total waste of my time. Just tell after prefix xor how you are getting the inner sub array's xor and getting there xor also
Xor is it's own inverse operation, just like how in prefix sums you do sum[a...b] = sum[b] - sum[a-1], you can do xor[a...b] = xor[b] ^ xor[a-1]. By the way, there's no need to be rude.
Probably the worst explanation, this guy has mugged up the whole solution
""""good to go"""""
wonder how this guy got hired
Awesome sir!
I think it will always give answer 0 if array have only one element
Please correct me if am wrong
No, it's gonna be that element ...? The maximum xor in [a] is a.
Good too go 🔥
waste of time , Pls focus properly on the logic part
good to go Sir
finally got it.
Thank you boss,
Your teaching , explanation is on point.
Jai hind.
Explanation not helpful. 41 mins wasted