Day 35: LeetCode 128 [Longest Consecutive Sequence]
Problem Description: Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
Link to LeetCode Problem: https://leetcode.com/problems/longest-consecutive-sequence/description/
Thought Process: gathering all the numbers in a single place so it can quickly check if a number exists or not, and then start checking each number to see how long of a consecutive sequence can be build.
