Single Element in a Sorted Array
Understand how to find the single element that appears only once in a sorted array where all other integers appear twice. Learn to implement an efficient binary search solution with O(log n) time and O(1) space complexity to solve this common coding interview 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]
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to check if you’re solving the correct problem:
Single Element in a Sorted Array
What is the output if the following array is provided as input?
[1, 1, 2, 2, 3, 4, 4]
1
3
2
4
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground.
package mainfunc singleNonDuplicate(nums []int) int {// Replace this placeholder return statement with your codereturn -1}