[프로그래머스] / [Level 2] / [Python] 메뉴 리뉴얼

https://school.programmers.co.kr/learn/courses/30/lessons/72411

프로그래머스

---

from collections import defaultdict
from itertools import combinations as C
def solution(orders, course):
    answer = []
    
    for co in course:
        count_dict = defaultdict(int)
        for order in orders:
            order = sorted(order)
            for o in list(C(order, co)):
                count_dict[o] += 1
                
        ordered = dict(sorted(count_dict.items(), key=lambda x:x[1], reverse=True))
        
        ordered_reverse = defaultdict(list)
        for k, v in ordered.items():
            if v >= 2:
                ordered_reverse[v].append(k)

        if len(ordered) != 0:
            for o in ordered_reverse[max(ordered.values())]:
                answer.append(o)
    
    return [''.join(v) for v in sorted(answer)]