reduce: longest consecutive sequence

Obnoxious Ocelot answered on September 30, 2023 Popularity 9/10 Helpfulness 1/10

answer reduce: longest consecutive sequence

reduce: longest consecutive sequence

Comment

const numbers = [1, 2, 4, 5, 6, 8, 9, 10, 11];

// Using reduce to find the longest consecutive sequence
const longestSequence = numbers.reduce(
  (acc, cur) => {
    if (cur === acc.current + 1) {
      acc.current = cur;
      acc.sequence.push(cur);
    } else {
      acc.current = cur;
      acc.sequence = [cur];
    }
    if (acc.sequence.length > acc.longest.length) {
      acc.longest = acc.sequence;
    }
    return acc;
  },
  { current: numbers[0], sequence: [numbers[0]], longest: [] }
).longest;

console.log(longestSequence); // Output: [ 8, 9, 10, 11]

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: chat.openai.com

Tags: javascript reduce sequence

Link to this answer
Share Copy Link

Contributed on Sep 30 2023

Obnoxious Ocelot

0 Answers Avg Quality 2/10

reduce: longest consecutive sequence

Contents

More Related Answers

reduce: longest consecutive sequence

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.