How should I practice Single Element in a Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Goldman Sachs onsite interview problems in FastPrep.

Is Single Element in a Sorted Array associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Single Element in a Sorted Array

Learn this problem

● Medium

Goldman SachsFULLTIMEONSITE INTERVIEW

Problem statement

Given a sorted integer array nums, every value appears exactly twice except for one value that appears exactly once.

Return the value that appears once. Your solution must run in O(log n) time and use O(1) extra space.

Function

singleNonDuplicate(nums: int[]) → int

Examples

Example 1

nums = [1,1,2,3,3,4,4]return = 2

Every value except 2 belongs to an adjacent pair.

Example 2

nums = [0]return = 0

The only element is the unique value.

Constraints

1 <= nums.length <= 100000
nums.length is odd.
-2147483648 <= nums[i] <= 2147483647
nums is sorted in nondecreasing order.
Exactly one value appears once; every other value appears exactly twice.