개발야옹

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

function solution(score) {
    let answer = new Array(score.length).fill().map((v) => 0);
    let args = [];
    score.forEach((sc, index) => {
        let total = 0;
        sc.forEach((s) => {
            total += s;
        })
        args.push({arg : total/sc.length, index: index});
    });
    
    args.sort(function(a,b) {
        return b.arg - a.arg;
    });
    
   
    let tmp = [];
    let max = 0;
    let rank =1;
    while(true) {
        if(args.length === 0){
            break;
        }
        
        if(tmp.length === 0) {
            tmp.push(args.shift());
            max = tmp[0].arg;
        }
        
        args.forEach((a) => {
               if(max === a.arg) {
               tmp.push(a);
            } 
        });
        
        args = args.filter((a) => max !== a.arg);
            
        for(let i = 0 ; i < tmp.length ;i++) {
            answer[tmp[i].index] = rank;
        }
        
        rank += tmp.length;
        tmp = [];
        max = 0;
        
    }
        
    return answer;
}

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

function solution(num, total) {
    var answer = [];
    if(num % 2 !== 0) {
        // 홀수
        let n = Math.floor(num/2);
        for(let i = 0 ;i < num ; i++ ){
            answer.push((total/num)-n+i);
        }
        return answer;
    }
    // 짝수
    let m = 0;
    for(let i = 1 ; i < num ; i++){
        m += i;
    }
    
    let n = (total-m)/num;
    for(let i = 0; i < num ; i++) {
        answer.push(n+i);
    }
    return answer;
}

https://school.programmers.co.kr/learn/courses/30/lessons/42842?language=javascript 

function solution(brown, yellow) {
    var answer = [];
    const yList = [];
    
    // [b, y] 
    // y의 가로 >= 세로 구성되는 경우의 수들 찾음 [ y1, y2 ]
    // (y1 * 2) + ( y2 + 2 ) * 2 === b 를 찾는다.
    // [y1+2 , y2+2] 를 리턴
    
    let i = 1;
    let w = 1;
    
    while(true) {       
        if(w < i) break;
        if(yellow % i === 0) {
            w = yellow / i;
            if(w < i) break;
            yList.push([w, i]);
        } 
        i++;
    }
    
    yList.forEach((y) => {
       let h = (y[0]*2)+((y[1]+2)*2);
        if(h === brown) {
            answer.push(y[0]+2);
            answer.push(y[1]+2);
            return false;
        }
    });
    
    
    return answer;
}

https://school.programmers.co.kr/learn/courses/30/lessons/42579?language=javascript# 

function solution(genres, plays) {
    var answer = [];
    const hash = {};
    const arr = [];
    let compare = [];
    
    for(let i = 0 ; i < genres.length ; i++) {
        compare.push({key: genres[i], value: plays[i], index: i});
        if(hash[genres[i]] === undefined) hash[genres[i]] = plays[i];
        else hash[genres[i]] += plays[i];
    }
    
    let keys = Object.keys(hash);
    keys.forEach( k => arr.push({key: k, value: hash[k]}));
    
    while(keys.length > 0) {        
        arr.sort(function(a,b) {
            return b.value - a.value;
        })
    
        let first = arr.length !== 0 ? arr.shift().key : false;
        if(first === false) return answer;
        
        compare.sort(function(a,b) {
            return a.key === first ? -1 : 1;
        })
        
        let bestCandi = compare.map((c) => {
            if(c.key === first) return c;
        }).filter((b) => { return b !== undefined});
    
        compare = compare.filter((c) => c.key !== first);   

        bestCandi.sort((a,b) => {
            // 횟수 순
            if(b.value !== a.value) return b.value - a.value;
            // 횟수 같으면 고유 번호 낮은 순
            return a.index - b.index;            
        });
        
        // best 후보 중 2개만 선택
        bestCandi = bestCandi.filter((d,index) => index < 2);
    
        bestCandi.forEach((b) => {
            answer.push(b.index);
        })
    
        delete hash[first];    
    }
    return answer;
}