-
Notifications
You must be signed in to change notification settings - Fork 0
/
bloomberg.py
212 lines (162 loc) · 4.69 KB
/
bloomberg.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
import heapq
from collections import Counter
'''
{
'quiz.sports.q1.question' = 'Which one is correct team name in NBA?',
'quiz.sports.q1.options[0]' = 'New York Bulls',
'quiz.sports.q1.options[1]' = 'Los Angeles Kings',
...
'quiz.sports.q1.answer' = 'Huston Rocket'
}
{
'quiz.sports.q1.quesitons.a[0]'
}
'''
"""
{
"quiz": {
"sport": {
"q1": {
"question": "Which one is correct team name in NBA?",
"options": [
"New York Bulls",
"Los Angeles Kings",
"Golden State Warriros",
"Huston Rocket"
]},
"answer": "Huston Rocket"
}
},
"maths": {
"q1": {
"question": "5 + 7 = ?",
"options": [
10,
11,
12,
13
],
"answer": 12
},
"q2": {
"question": "12 - 8 = ?",
"options": [
1,
2,
3,
4
],
"answer": 4
}
}
}
}
"""
ans = {}
def recur(dct, ans_str=''):
ct = 0
for key in dct:
ans_str += (key + ".") # quiz.
val_1 = dct[key]
if type(val_1) == dict:
recur(val_1, ans_str)
elif type(val_1) != dict:
if type(val_1) == list:
for idx, x in enumerate(val_1):
ans[ans_str + str(idx)] = x
else:
ans_str = ans_str[:len(ans_str)-1]
print (ans_str)
ans[ans_str] = val_1
ct += 1
return ans
"""
https://leetcode.com/discuss/interview-question/688722/bloomberg-phone/696597
a = [21,5,6,56,88,52], output = [5,5,5,4,-1,-1]
"""
from heapq import *
def find_right_index(nums):
ans = [-1]*len(nums)
heap = []
for idx, x in enumerate(nums):
heappush(heap, (-x, idx))
max_idx = -1
while heap:
temp = heappop(heap)
val, curr_idx = -temp[0], temp[1]
if max_idx == -1 or curr_idx > max_idx or nums[max_idx] == nums[curr_idx]:
max_idx = max(curr_idx, max_idx)
continue
ans[curr_idx] = max_idx
max_idx = max(curr_idx, max_idx)
return ans
# find_right_index([21,5,6,56,88,5])
class UDP(object):
def __init__(self):
self.dct = {}
def udp_packets(self, number):
dct = self.dct
if dct:
if number-1 in dct and number+1 not in dct:
print (number-1, number)
del dct[number-1]
if number-1 in dct and number+1 in dct:
print (number-1, number, number+1)
del dct[number-1]
del dct[number+1]
return
if number+1 in dct and number-1 not in dct:
print (number+1, number)
del dct[number+1]
return
if number +1 in dct and number-1 not in dct:
print (number-1, number, number+1)
del dct[number-1]
del dct[number+1]
return
dct[number] = number
# abc = UDP()
# abc.udp_packets(2)
# abc.udp_packets(4)
# abc.udp_packets(6)
# abc.udp_packets(5)
# abc.udp_packets(7)
# abc.udp_packets(3)
# abc.udp_packets(4)
# abc.udp_packets(8)
# abc.udp_packets(10)
# abc.udp_packets(9)
# abc.udp_packets(15)
# abc.udp_packets(12)
# abc.udp_packets(11)
# abc.udp_packets(17)
# abc.udp_packets(14)
# abc.udp_packets(13)
# abc.udp_packets(11)
# abc.udp_packets(19)
# abc.udp_packets(22)
class frequency():
def output(self, nums):
cnt = {}
for item in nums:
if item not in cnt:
cnt[item] = 1
else:
cnt[item] += 1
newCnt = sorted(cnt.items(), key=lambda x: (x[1], -x[0]))
soln = []
for item in newCnt:
element, count = item
soln.extend([element] * count)
print (soln)
# heap = []
# element_to_frequency = Counter(elements)
# elements = []
# for element, frequency in element_to_frequency.items():
# heapq.heappush(heap, (frequency, -element))
# while heap:
# frequency, element = heapq.heappop(heap)
# elements.extend([-element] * frequency)
# return elements
abc = frequency()
abc.output([3, 4, 2, 5, 2, 3, 4, 3, 6,6,6,6])