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

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

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

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

<p><strong class="example">Example 2:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def longestConsecutive(self, nums: List[int]) -> int:
        nums = sorted(nums)

        print(nums)
        if len(nums) ==0:
            return 0

        l=0
        r= 1
        max_so_far= 1
        local_max=1
        while r < len(nums):
            
            print(l,r,nums[r-1],nums[r],nums[r-1]+1 == nums[r])
            if nums[r-1] == (nums[r]):
                r+=1
                l+=1
                continue

            if nums[r-1]+1 == (nums[r]):
                print("hit")
                r+=1
                local_max+=1
                max_so_far=max(local_max,max_so_far)
                print(max_so_far)
            else:
                local_max=1
                l
                r+=1

        return max_so_far


            
        
29590