← All problemsSign in

Chef and Distinct Numbers

Given an array $A$ of size $N$ , check if there exist any pair of index $i,j$ such that $A_i = A_j$ and $i \neq j$ ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. - The first line of each test case contains integer $N$. - The second line of each test case contains $N$ space separated integers $A_i$. ### Output For each tes

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