Your Web News in One Place

Help Webnuz

Referal links:

Sign up for GreenGeeks web hosting
April 20, 2022 04:45 am GMT

Longest Consecutive Sequence

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.

Input: nums = [100,4,200,1,3,2]Output: 4Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
var longestConsecutive = function (nums) {    let num_set = new Set(nums);    let longestStreak = 0;    for (let num of nums) {        if (!num_set.has(num - 1)) {            let currentNum = num;            let currentStreak = 1;            while (num_set.has(currentNum + 1)) {                currentNum += 1;                currentStreak += 1;            }            longestStreak = Math.max(longestStreak, currentStreak);        }    }    return longestStreak;}

Time Complexity : O(n)


Original Link: https://dev.to/styluso7/longest-consecutive-sequence-2bo0

Share this article:    Share on Facebook
View Full Article

Dev To

An online community for sharing and discovering great ideas, having debates, and making friends

More About this Source Visit Dev To