7
Assumptions
The array is sorted.
There is only one duplicate.
The array is only populated with numbers [0, n], where n is the length of the array.
Example array: [0,1,2,3,4,5,6,7,8,8,9]
Here is my implementation:
public static int DuplicateBinaryFind(int[] arr, int left, int right)
{
...