#### One Duplicate Number

##### An array of size n+1, such that 1 ≤ array[i] ≤ n, then find duplicate element. But using O(1) extra memory and less than in O(n^2).

Latest Source Code:

Github: OneDuplicateNumber.java

**Output:**

Array : [1, 2, 2] Duplicate Element: 2