longest-consecutive-sequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an unsorted array of integers <code>nums</code>, return the length of the longest consecutive elements sequence.

You must write an algorithm that runs in&nbsp;<code>O(n)</code>&nbsp;time.

&nbsp;
Example 1:

<pre>
Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is <code>[1, 2, 3, 4]</code>. Therefore its length is 4.
</pre>

Example 2:

<pre>
Input: nums = [0,3,7,2,5,8,4,6,0,1]
Output: 9
</pre>

Example 3:

<pre>
Input: nums = [1,0,1,2]
Output: 3
</pre>

&nbsp;
Constraints:

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

longestConsecutive

Longest Consecutive Sequence

Array

Hash Table

Union Find

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie