Count Triplets That Can Form Two Arrays of Equal XOR

[@mohammadfraz]

There is a correction, the final approach is O(N^2) and not O(N).In case when we have [0,0,0,0] we will have to go through all the indexes each time, this will make it O(N^2)

[@JUSTcode00]

and brute force will take o(n^3) ig

[@namanmittal9403]

I am unable to understand why we have a triplet from 1 to 2 i.e 1,2,2 because cumulative XOR at both index 0 and 2 is 1 and you said if cumulative is 0 then only triplet from i+1 i.e 1 to 2 possible, please help me understand.

[@arpittiwari6590]

Where do you learn these concepts please tell us

[@ratnasanjay]

Thankyou bhaiya for this session

[@aryan__o]

Thank you Sir 😘

[@chenjieY-z3q]

somebody please do the O(n) solution explanation, the editorial makes no sense

[@subhambanerjee6334]

Did you solved the 3rd one

[@mohammadfraz]

Yes, it was simple DFS. Could not make the video though.

[@subhambanerjee6334]

@@mohammadfraz okay bro thank you

[@adityajangid3528]

accent??