개발야옹

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

const GCD = (num1, num2) => {
    let result = -1;
    for(let i = 2; i <= Math.min(num1, num2) ; i++ ) {
        if(num1 % i === 0 && num2 % i === 0) {
            result = i;
        }
    }
    return result;
}

function solution(numer1, denom1, numer2, denom2) {
    numer1 = numer1 * denom2;
    numer2 = numer2 * denom1;
    denom1 = denom1 * denom2;
    denom2 = denom2 * denom1;
    
    let numer = numer1 + numer2;
    let denom = denom1;
    
    return GCD(numer, denom) === -1 ? [numer, denom] : [numer/GCD(numer, denom) , denom/GCD(numer, denom) ]
}

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;
}