Frequency End

CodeChefOpen on judge ↗

Chef has an array of N natural numbers most of them are repeated. Cheffina challenges chef to find all numbers(in ascending order) whose frequency is strictly more than K. ###Input: - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains two lines of input, two integers $N, K$. - N space-separated natural numbers. ###Output: For e

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