Write a method called longestSortedSequence that returns the length of the longest sorted sequence within a list of integers. For example, if a variable called list stores [1, 3, 5, 2, 9, 7, −3, 0, 42, 308, 17], then the call of list.longestSortedSequence( ) would return 4 because it is the length of the longest sorted sequence within this list (the sequence −3, 0, 42, 308). If the list is empty, your method should return 0. Notice that for a nonempty list the method will always return a value of at least 1 because any individual element constitutes a sorted sequence.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.