Question

You are given a sorted array of integers. Each element in the array occurs 2 times expect one element. Find the element that occurs just once in the array in just O(logN) time and O(1) extra space. Sample Input 1: Array = 1,1,2,2,3,4,4 Output Input 1: 3

Answer 1

Answer:

Sorry I can't answer this question