Putin 100th Challenge

CodeChefOpen on judge ↗

Putin loves solving challenges. His friend has given him a question as a challenge. Given an integer array A[] of size N containing elements in the range [1, N - 1]. Putin needs to find the only element in the array which has frequency > 1 to sucessfully solve his 100th challenge. Note: It is guaranteed that there will be only one element with frequency > 1. ### Input - The first line of input

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