# Problem 514
#   Medium
#   Asked by Microsoft
#
# Given an unsorted array of integers, find the length of the longest consecutive 
#   elements sequence.
#
# For example, given [100, 4, 200, 1, 3, 2], the longest consecutive element sequence is 
#   [1, 2, 3, 4]. Return its length: 4.
#
# Your algorithm should run in O(n) complexity.
#
f3db0b0acbba7ea1eeb78056e1520bbb63eab331
# Problem 514
#   Medium
#   Asked by Microsoft
#
# Given an unsorted array of integers, find the length of the longest consecutive 
#   elements sequence.
#
# For example, given [100, 4, 200, 1, 3, 2], the longest consecutive element sequence is 
#   [1, 2, 3, 4]. Return its length: 4.
#
# Your algorithm should run in O(n) complexity.
#