Superstar Dishes

CodeChefOpen on judge ↗

Chef recently organised a **Grand Feast** where he served $n$ **different dishes** to his friends.\ Each friend picked their favourite dish, and now Chef has a list of all the dishes chosen. The dishes are named using number from $-10^9$ to $10^9$. Chef is curious: - Which dishes were so popular that they were chosen by more than $\lfloor \frac{n}{3} \rfloor$ friends? Print the dishes in increas

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