Stair Sequence

CodeChefOpen on judge ↗

Virat Kohli loves integer sequences very much. He especially likes stairs(he barely uses lifts). Sequence a1, a2, ..., an is stairs if there is such index i (1 ≤ i ≤ n), that the following condition is met: a1 < a2 < ... < ai - 1 < ai > ai + 1 > ... > a|a| - 1 > a|a|. For example, sequences [1, 2, 3, 2] and [4, 2] are stairs and sequence [3, 1, 2] isn't. Kohli spending his quarantine so he

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI