Reverse Every Ascending
Create and return a new array that contains the same elements as the given array items, but with the reversed order of the elements inside every maximal strictly ascending subsequence. This function should not modify the contents of the original array.
Input: Array of integers (number).
Output: Array of integers (number).
Examples:
assert.deepStrictEqual(reverseAscending([1, 2, 3, 4, 5]), [5, 4,...
You should be an authorized user in order to see the full description and start solving this mission.
