← All problemsSign in

7 Use Map Please

You are given a sequence of $N$ integers, $a = (a_1, a_2, ..., a_N)$. The elements of the sequence are not necessarily distinct. Let's define a sequence to be a **good sequence** if the frequency of each element in the sequence is exactly 1 i.e, all elements of the sequence are unique. For example of : $(1, 2, 3), (2, 6, 7), (3, 4), (6), (9)$ are good sequences while $(3, 4, 3), (6, 6, 9),

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