Write a method called longestSortedSequence that accepts an array of integers as a parameter and returns the length of the longest sorted (nondecreasing) sequence of integers in the array. For example, in the array [3, 8, 10, 1, 9, 14, −3, 0, 14, 207, 56, 98, 12], the longest sorted sequence in the array has four values in it (the sequence −3, 0, 14, 207), so your method would return 4 if passed this array. Sorted means nondecreasing, so a sequence could contain duplicates. Your method should return 0 if passed an empty array.
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.