Solution: Single Element in a Sorted Array

Let's solve the Single Element in a Sorted Array problem using the Modified Binary Search pattern.

We'll cover the following

Statement

You are given a sorted array of integers, nums, where all integers appear twice except for one. Your task is to find and return the single integer that appears only once.

The solution should have a time complexity of O(log⁡n)O(\log n) or better and a space complexity of O(1)O(1).

Constraints:

  • 1≤1 \leq nums.length ≤103\leq 10^3

  • 0≤0 \leq nums[i] ≤103\leq 10^3

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.