Range Minimize
You are given an array $A$ containing $N$ integers. You can delete **at most two** of its elements. Find the minimum possible value of $(\max(A) - \min(A))$ (in other words, the range of $A$) after the deletions. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of two lines of input. - The first line of each
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.
Sign in to chat with the tutor and save your progress.
Sign in to start