Description

Find the longest consecutive sequence in an unsorted array. :: Create a graph and just count how many times you can do n+1 from each.

Runtime

O(2n)

Pseudocode

for n in nums:
	graph[n]=n+1
	
for n in graph:
	ignore each n with a n-1
	while n+1 in graph increment count
return count