Hardest problem ever

CodeChefOpen on judge ↗

You have an integer array A of size N. Find closest pair of numbers in an array and print their difference. Input The first line of the input contains an integer T denoting the number of test cases. The description of T cases follows. Integer N and next line contains N space separated values (Ai) Output For each test case output a difference between closest pair Constraints - 1 ≤ T ≤ 20 -

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