264. Single Element in a Sorted Array
MediumBinary Search
You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once. Your solution must run in O(log n) time and O(1) space.
Examples
Input: [1,1,2,3,3,4,4,8,8]
Output: 2
Explanation: 2 is the only element without a pair.
Constraints
- 1 <= nums.length <= 10^5
- 0 <= nums[i] <= 10^5
Loading...
Run checks all cases above. Submit evaluates all test cases.