Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Single Element in a Sorted Array

Explore how to identify the unique element in a sorted array where all other elements appear twice. Learn to implement a modified binary search approach that efficiently narrows down the search space to find the non-duplicate integer. This lesson helps you understand the index manipulation and logical conditions required to solve the problem in O(log n) time and constant space.

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 ...