Find Duplicate in Sorted Array

Problem

Given a sorted array of integers nums where every value appears exactly twice except for one value that appears once, return the value that appears only once. The function should take a list of integers and return a single integer. Solve it in O(log n) time.

Constraints

• 1 <= len(nums) <= 10^5
• len(nums) is odd
• -10^5 <= nums[i] <= 10^5
• nums is sorted in non-decreasing order
• Every element appears exactly twice except one element, which appears once