The question says :" find the integer that is not there in the list." So it seems that there is only one missing integer. Also the list contains 2^32 integers and if we take all possible integers, assuming an integer takes 4 bytes, we get 2^32 integers. So, if 1 integer is missing in the list, it means that at least 1 no. is repeating in the list. So, the xor method fails in this case.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
