Tap here to switch tabs
Problem
Ask
Submissions

Problem: Single Element in a Sorted Array

med
30 min
Explore how to efficiently find the unique element in a sorted array where all others appear twice. Learn to apply a modified binary search approach that operates in logarithmic time and constant space, sharpening your skills for coding interviews focused on search algorithms.

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 nums.length 103\leq 10^3

  • 00 \leq nums[i] 103\leq 10^3

Tap here to switch tabs
Problem
Ask
Submissions

Problem: Single Element in a Sorted Array

med
30 min
Explore how to efficiently find the unique element in a sorted array where all others appear twice. Learn to apply a modified binary search approach that operates in logarithmic time and constant space, sharpening your skills for coding interviews focused on search algorithms.

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 nums.length 103\leq 10^3

  • 00 \leq nums[i] 103\leq 10^3