HackerEarth - Repeated K Times Solution
Poor Man
- Published
- Updated
- Reading time
- 1 min read
- Length
- 141 words
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
Text
5
2 2 1 3 1
2SAMPLE OUTPUT
Text
1Solution in Python#
Text
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])
