메뉴 리뉴얼

programmers.co.kr/learn/courses/30/lessons/72411?language=javascript

코딩테스트 연습 - 메뉴 리뉴얼

function solution(orders, course) {
    const orderedCountMap = new Map();
    const maxCountMap = new Map();
    const courseSet = new Set(course);
    
    const combination = (result, index, str) => {
        if (courseSet.has(result.length)) {
            let cnt = orderedCountMap.get(result) || 0;
            orderedCountMap.set(result, ++cnt);
            
            const max = maxCountMap.get(result.length) || 0;
            if (max < cnt) maxCountMap.set(result.length, cnt);
        }
        for (let i = index; i < str.length; i++) combination(result + str[i], i+ 1, str);
    }
    orders.map((order) => order.split("").sort().join("")).forEach((order) => combination("", 0, order));
    return course.map((length) => {
        const max = maxCountMap.get(length);
        return Array.from(orderedCountMap).filter((order) => order[0].length === length && order[1] >= 2 && order[1] === max).map((order) => order[0]);
    }).flatMap((order) => order).sort();
}