A consecutive-run is a list of adjacent, consecutive integers. This list can be either increasing or decreasing. Create a function that takes an array of numbers and returns the length of the longest consecutive-run. To illustrate: longest Run ([1, 2, 3, 5, 6, 7, 8, 9]) → 5 // Two consecutive runs: [1, 2, 3] and [5, 6, 7, 8, 9] (longest). Examples longestRun ([1, 2, 3, 10, 11, 15]) 3 // Longest consecutive-run: [1, 2, 3]. longest Run ([5, 4, 2, 1]) → 2 // Longest consecutive-run: [5, 4] and [2, 1]. longestRun ([3, 5, 7, 10, 15]) → 1 // No consecutive runs, so we return 1.
A consecutive-run is a list of adjacent, consecutive integers. This list can be either increasing or decreasing. Create a function that takes an array of numbers and returns the length of the longest consecutive-run. To illustrate: longest Run ([1, 2, 3, 5, 6, 7, 8, 9]) → 5 // Two consecutive runs: [1, 2, 3] and [5, 6, 7, 8, 9] (longest). Examples longestRun ([1, 2, 3, 10, 11, 15]) 3 // Longest consecutive-run: [1, 2, 3]. longest Run ([5, 4, 2, 1]) → 2 // Longest consecutive-run: [5, 4] and [2, 1]. longestRun ([3, 5, 7, 10, 15]) → 1 // No consecutive runs, so we return 1.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
JS Prog SOl Needed
![A consecutive-run is a list of adjacent, consecutive integers. This list can be either increasing or
decreasing. Create a function that takes an array of numbers and returns the length of the
longest consecutive-run.
To illustrate:
longest Run ([1, 2, 3, 5, 6, 7, 8, 9]) → 5
// Two consecutive runs: [1, 2, 3] and [5, 6, 7, 8, 9] (longest).
Examples
longestRun ([1, 2, 3, 10, 11, 15]) → 3
// Longest consecutive-run: [1, 2, 3].
longest Run ([5, 4, 2, 1]) → 2
// Longest consecutive-run: [5, 4] and [2, 1].
longestRun ([3, 5, 7, 10, 15]) → 1
// No consecutive runs, so we return 1.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F677de065-d6a6-49e7-92fb-cd193ff724e2%2F6d3da9dc-ee91-4243-974b-1f643dc2403e%2Fd1x09oc_processed.png&w=3840&q=75)
Transcribed Image Text:A consecutive-run is a list of adjacent, consecutive integers. This list can be either increasing or
decreasing. Create a function that takes an array of numbers and returns the length of the
longest consecutive-run.
To illustrate:
longest Run ([1, 2, 3, 5, 6, 7, 8, 9]) → 5
// Two consecutive runs: [1, 2, 3] and [5, 6, 7, 8, 9] (longest).
Examples
longestRun ([1, 2, 3, 10, 11, 15]) → 3
// Longest consecutive-run: [1, 2, 3].
longest Run ([5, 4, 2, 1]) → 2
// Longest consecutive-run: [5, 4] and [2, 1].
longestRun ([3, 5, 7, 10, 15]) → 1
// No consecutive runs, so we return 1.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY