pyassistant

Archive

Longest Continuous Increasing Subsequence

Given a list of integers, write a function to return the longest continuous increasing subsequence (strictly ascending) in the list.

Example:

Input: 
[1, 3, 5, 4, 7, 8, 9, 2, 6]
Output: 
[4, 7, 8, 9]

Make sure you return your solution, don't print!

AI

Bot

Trying to solve my challenge? Ask if you must, or press the purple button so I can analyze your code.