-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsherlock.py
56 lines (36 loc) · 1005 Bytes
/
sherlock.py
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
49
50
51
52
53
54
55
56
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the isValid function below.
def isValid(s):
freq = {}
freq_list = []
is_valid = False
for i in s:
if i in freq:
freq[i] += 1
else:
freq[i] = 1
for k, v in freq.items():
freq_list.append(v)
for i in range(len(freq_list)):
if all(x == freq_list[0] for x in freq_list):
return "YES"
freq_list[i] = freq_list[i] - 1
removed_list = freq_list[:]
if freq_list[i] == 0:
removed_list.remove(freq_list[i])
is_valid = all(x == removed_list[0] for x in removed_list)
if is_valid == True:
return "YES"
freq_list[i] = freq_list[i] + 1
return "NO"
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
s = input()
result = isValid(s)
fptr.write(result + '\n')
fptr.close()