Productivity
CodeChefOpen on judge ↗
You are given a sequence of integers A1, A2, A3...AN. Find the highest possible value of (Ai - Aj) * (Ai + Aj). Input The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. - The first line of a test case contains an integer N. - The second line of a test case contains an array of N elements. Output For each test case, ou
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