Search⌘ K
AI Features

Solution: Single Element in a Sorted Array

Explore how to locate the single non-duplicate element in a sorted array that contains pairs of duplicated elements using a modified binary search approach. This lesson teaches you to adjust pointers and use index properties to efficiently identify the unique element in O(log n) time with constant space.

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(logn)O(\log n) or better and a space complexity of O(1)O(1).

Constraints:

  • 11 \leq ...