MAX DIFFERENCE

CodeChefOpen on judge ↗

Given $N$ positive unique integers .For a specific position i $(0\leq i \leq N-1)$ Let us define X as absolute difference between previous greater element (First element to the left of i which is greater then element at index i ) and next greater element (First element to the right of i which is greater then element at index i ) in the array .You have to find all possible index for which X is ma

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