MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / search

Function search

javascript/0128-longest-consecutive-sequence.js:52–71  ·  view source on GitHub ↗
(nums)

Source from the content-addressed store, hash-verified

50};
51
52const search = (nums) => {
53 let [maxScore, score] = [1, 1];
54
55 for (let i = 1; i < nums.length; i++) {
56 /* Time O(N) */
57 const isPrevDuplicate = nums[i - 1] === nums[i];
58 if (isPrevDuplicate) continue;
59
60 const isStreak = nums[i] === nums[i - 1] + 1;
61 if (isStreak) {
62 score++;
63 continue;
64 }
65
66 maxScore = Math.max(maxScore, score);
67 score = 1;
68 }
69
70 return Math.max(maxScore, score);
71};
72
73/**
74 * Hash Set - Intelligent Sequence

Callers 1

longestConsecutiveFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected