← All problemsSign in

Candy Types

CodeChefRating 723Open on judge ↗

The candies in this universe come in $N$ colours, numbered $1$ to $N$. You have $N$ candies with you, the $i$-th candy having a colour $A_i$. You wonder what is the most frequent colour among your candies. In case there is a tie, you should print the smaller colour among all the most frequent colours. ### Input - The first line of input will contain a single integer $T$, denoting the number o

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