single-element-in-a-sorted-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.

Return the single element that appears only once.

Your solution must run in <code>O(log n)</code> time and <code>O(1)</code> space.

&nbsp;
Example 1:
<pre>Input: nums = [1,1,2,3,3,4,4,8,8]
Output: 2
</pre>Example 2:
<pre>Input: nums = [3,3,7,7,10,11,11]
Output: 10
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 105</code></li>
</ul>

singleNonDuplicate

Single Element in a Sorted Array

Array

Binary Search

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie