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

Solution: Single Element in a Sorted Array

Explore how to use a modified binary search to efficiently find the single element that appears once in a sorted array where others appear twice. This lesson helps you understand pointer adjustments and index checking to solve the problem with optimal time and space complexities.

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