Single Element in a Sorted Array
Try to solve the Single Element in a Sorted Array problem.
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 or better and a space complexity of .
Constraints:
-
nums.length
-
nums[i]
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy