| about | help | code help+videos | done | prefs |
Define a function that when passed a list, returns the longest subsequence that is in ascending order in the list. In case of a tie, return the sequence occurring first. longestAscendingRun([]) → [] longestAscendingRun([10, 60, 71, 120, 80, 100]) → [10, 60, 71, 120] longestAscendingRun([1, 7, 3, 9]) → [1, 7] longest_ascending_run([10, 60, 71, 120, 80, 100]) → [10, 60, 71, 120] longest_ascending_run([1, 7, 3, 9]) → [1, 7] longest_ascending_run([2, 1, 1, 4, 8]) → [1, 1, 4, 8] ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 5 Post-solution available
Copyright Nick Parlante 2017 - privacy