Second question was a variation of stock span problem. You were given an array and you had return an array that contains maximum consecutive days in which arr[i] >= arr[j] where 0<= i < n and i+1 <= j < n-1