Question

Given an integer array of size 2n + 1. In this given array, n numbers are present twice and one number is present only once in the array. You need to find and return that number which is unique in the array.

Answer 1

Answer:

ififkfjfjdjckvkgkfjdhmmfmg