title: Find the two non-repeating elements in an array of repeating element XOR operator?
body: <p>Suppose I have an array with 2n+2 elements. n elements in array are occurring twice and remaining two elements are unique. You have to solve this in O(n) time and O(1) space. One of the solution is using XOR. But I am not able to understand that. Can anyone help me regarding that or can give me better solution ?</p>
  
  <p>Link of the Problem and solution is <a href="http://www.geeksforgeeks.org/archives/2457" rel="nofollow noreferrer">this</a></p>