⏰ Time complexity: O(n)
🧺 Space complexity: O(1)

Method 5 - Using array index and multiplication (Works for positive elements)

Here is the code : Find duplicates in a ranged array0-n) in O(n) time and O(1) extra space

Complexity

⏰ Time complexity: O(n)
🧺 Space complexity: O(1)

Method 6 - Using XOR

if we know that only 2 elements repeat and that too twice, we can use Single Number 3 - All elements except two occur twice.

XOR all the numbers in the array with all numbers from 1 to n. The result will be X XOR Y. Since 1 XOR 1 = 0 and 1 XOR 0 = 1, the result of X XOR Y where any kth bit is set to 1 implies that either X or

Related Tags