You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
HackerEarth - Repeated K Times Solution

HackerEarth - Repeated K Times Solution

Beeze Aal
Beeze Aal

Given a List of N number a1,a2,a3........an, You have to find the smallest number from the List that is repeated in the List exactly K number of times.

Input Format

First Line of Input Contain Single Value N, Size of List

Second Line of Input Contain N Space Separated Integers

Third Line of Input Contain Single Value K

Output Format

Smallest Integer Value That is Repeated Exactly K Number of Time

Constraints

  • 0 < N < 100001
  • 0 <= K < 100001
  • 0 <= ai < 100001

NOTE

There Will Be Atleast One Variable Which Is Repeated K Times

SAMPLE INPUT

5
2 2 1 3 1
2

SAMPLE OUTPUT

1

Solution in Python

from collections import Counter
n = int(input())
a = list(map(int,input().split()))
k = int(input())
c = Counter(a)
print(min(filter(lambda x:x[1]==k,c.items()))[0])