← All problemsSign in

Check Adjacent Sum

CodeChefRating 1564Open on judge ↗

You are given an array $A$ of size $N$ $(N \ge 2)$. Define $f(A) = \sum_{i = 1}^{N - 1} (A_i + A_{i + 1})$. You are given $Q$ queries, each with a single integer $X$. Determine if there exists a rearrangement of the array $A$ such that $f(A) = X$. If there exists a valid rearrangement, print it, else print $-1$. ### Input - The first line of input will contain a single integer $T$, denoting

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

Sign in to chat with the tutor and save your progress.

Sign in to start