I have found one problem which can be solved using the concept of "XOR of two duplicate number equals to zero". For an array with consecutive numbers (sorted or shuffled) with only one of the numbers having its’ duplicate, for finding that duplicate value this solution will work. I am searching for more problems like this.
>Solution :
Some useful resources/links are given:
- Bitwise XOR operator to find missing unique ID
- https://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/
- https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/zero-xor-e3085486/ [important]
- https://codeforces.com/problemset/problem/1101/G [important]
- https://www.codechef.com/problems/MXZERO [important]