Comments
0

Mine?
+5

I could infer we have to make xor of first two numbers equal to xor of the rest of the array. How to proceed further?
+3

Yup, this would be much better.
On shobhit907 → Try hacking a solution, 6 years ago
0

See solve2() function in my solution. Basically when adding characters in a new string, I am randomizing my solution,i.e., picking any character at that index from the given list of strings.

+9

What do you mean by O(n), but faster? Do you mean 'with smaller constant factor'?
0

⚡Lightning speed editorial
0

You may see my binary search implemented solution. 79500682
0

Thanks a lot for the great explanation
0

Can you tell how you reduced the problem to this?