| about | help | code help+videos | done | prefs |
maxIncreasing() -- Given a list L of integers, return the length of longest contiguous and strictly increasing subsequence of the list. maxIncreasing([5, 9, 1, 10]) → 2 maxIncreasing([2, 2, 4, 6, 6]) → 3 maxIncreasing([3, 6, 2, 10, 20, 5, 100]) → 3 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy