Second largest number

CodeChefOpen on judge ↗

Find the second largest number from the given three numbers. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, three integers $n1, n2 and n3$. ###Output: For each testcase, output the second largest number of the given number. ###Constraints - $1 \leq T \leq 1000$ - $2 \leq n1,n2,n3 \l

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