Greatest Number

CodeChefOpen on judge ↗

Chef has N numbers and he wants to choose one number from these numbers in such a way that the chosen number has occurred at least more than once and is greater than other repeated numbers. Output 0 if there is No repeating number. ### Input First line contains number of test cases T, followed by T lines, each containing a number N which defines the total numbers. ### Output For each test case

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