-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpair_in_Array.py
More file actions
48 lines (36 loc) · 931 Bytes
/
pair_in_Array.py
File metadata and controls
48 lines (36 loc) · 931 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'sockMerchant' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER n
# 2. INTEGER_ARRAY ar
#
def sockMerchant(n, ar):
# Write your code here
frequency = {}
count = 0
# Count the frequency of each element
for num in ar:
if num in frequency:
frequency[num] += 1
else:
frequency[num] = 1
# Count the number of pairs for each element
for num, freq in frequency.items():
if freq >= 2:
count += freq // 2
return count
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
ar = list(map(int, input().rstrip().split()))
result = sockMerchant(n, ar)
fptr.write(str(result) + '\n')
fptr.close()