Longest Consecutive Sequence

Try to solve the Longest Consecutive Sequence problem.


Given an unsorted array, nums, your task is to return the length of the longest consecutive sequence of elements. The consecutive sequence of elements is such that there are no missing elements in the sequence. The consecutive elements can be present anywhere in the input array.

Note: Two elements, xx and yy, are called consecutive if the difference between them is equal to 11.


  • 00 \leq nums.lengths 103\leq 10^{3}
  • 106-10^{6} \leq nums[i] 106\leq 10^{6}


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy