Pleasant Array

CodeChefOpen on judge ↗

Milo has an array of size $N$ containing $N$ distinct integers. Milo doesn't like the current arrangement of the elements of the array, he only likes pleasant arrays. An array is said to be pleasant if there exists an arrangement of elements of the array such that after rearranging the elements, the absolute difference between any two adjacent elements of the array is equal to $1$. Tell whether

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