HInt of the problem

#1

Can you give me a hint for this question …as it is a little confusing…So please

#2

its simple implementation, set idx to 0 and proceed uptil sequence is decreasing(stop as soon as condition violates), from same position, do for increasing sequence, now if all elements are covered(idx==n) then answer is yes otherwise no.