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

Solution: Single Element in a Sorted Array

Explore how to apply modified binary search to find the single element that appears once in a sorted array where all others appear twice. Learn to adjust pointers based on index parity and pair checks for an optimized O(log n) time and constant space solution.

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