1from collections import defaultdict
2
3def solution(s):
4    count = defaultdict(int)
5    for i in s[1:-1].replace('},{', '} {').split(' '):
6        for j in i[1:-1].split(','):
7            count[j] += 1
8    return [int(i[0]) for i in sorted(count.items(), key=lambda x: x[1], reverse=True)]

 1from itertools import permutations
 2def solution(expression):
 3    answer = 0
 4    operations = list(filter(lambda x: not x.isdigit(), expression))
 5    numbers = expression.replace('-','+').replace('*','+').split('+')
 6    expression = [int(numbers[0])]
 7
 8    for i in range(len(operations)):
 9        expression.append(operations[i])
10        expression.append(int(numbers[i+1]))
11
12    for case in permutations(('+', '-', '*'), 3):
13        temp = expression[::-1]
14        for op in case:
15            stack = []
16            while temp:
17                if temp[-1] == op:
18                    temp.pop()
19                    a = stack.pop()
20                    b = temp.pop()
21                    stack.append(eval(str(a)+op+str(b)))
22                else:
23                    stack.append(temp.pop())
24            temp = stack[::-1]
25        answer = max(answer, abs(temp[0]))
26    return answer

 1answer = [0, 0]
 2
 3def solution(arr):
 4    def recursion(sx, sy, k):
 5        global answer
 6        origin = arr[sy][sx]
 7        cnt = 0
 8        for i in range(sx, sx+k):
 9            for j in range(sy, sy+k):
10                if origin != arr[j][i]:
11                    recursion(sx, sy, k//2)
12                    recursion(sx+k//2, sy, k//2)
13                    recursion(sx, sy+k//2, k//2)
14                    recursion(sx+k//2, sy+k//2, k//2)
15                    return
16        answer[origin] += 1
17
18    recursion(0, 0, len(arr))
19    return answer

 1def solution(s):
 2    answer = []
 3    cnt = 0
 4    zero_cnt = 0
 5    
 6    while len(s) != 1:
 7        zero = s.count('0')
 8        s = str(bin(len(s)-zero)).split('b')[1]
 9        cnt += 1
10        zero_cnt += zero
11        
12    return [cnt, zero_cnt]

 1from itertools import combinations
 2from collections import defaultdict
 3
 4def solution(orders, course):
 5    answer = []
 6
 7    for i in course:
 8        dataset = defaultdict(int)
 9
10        for j in orders:
11            for k in combinations(j, i):
12                # ABC, ACB를 같은 것으로 취급하기 위해 정렬
13                dataset[''.join(sorted(k))] += 1
14
15        if len(dataset) == 0:
16            continue
17
18        max_value = max(dataset.values())
19
20        # 2번 이상 주문된 메뉴만 추가
21        if max_value == 1:
22            continue
23        
24        for k, _ in filter(lambda x:x[1] == max_value, dataset.items()):
25            answer.append(''.join(k))
26
27    return sorted(answer)