You are given an array Arr of size N. Replace every element with the next greatest element (greatest element on its right side) in the array. Also, since there is no element next to the last element, ...
Though the problems number from 1 to 99, there are some gaps and some additions marked with letters. There are actually only 88 problems. There is no nested list type in OCaml, so we need to define ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results