Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
To find the longest sequential prefix, iterate from left to right. For a fixed <code>i</code>, if <code>nums[i] != nums[i - 1] + 1</code> then the longest sequential prefix ends at <code>i - 1</code>.