Day 12 of 31-Day May LeetCode Challenge

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Find this single element that appears only once. Note: Your solution should run in O(log n) time and O(1) space.