Given an array of size n, which has all distinct elements between 1 to n with one element repeating, which also implies that one element is missing. How to find the repeating element without using extra space and linear time complexity ?
Any way to do it with exor ? :P --
