개발야옹

시저 암호

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

function solution(s, n) {
    // a - z: 97~122
    // A - Z: 65~90
    var answer = [];
    s = s.split('');
    s.forEach((d) => {
        let code = d.charCodeAt();
        if(d === ' ') { answer.push(' '); }
        else if(code+n > 122 && code >= 97) {
            answer.push(String.fromCharCode(97+(code+n - 122-1)));
        }
        else if(code+n > 90 && code <= 90) {
            answer.push(String.fromCharCode(65+(code+n - 90-1)));
        }
        else {
            answer.push(String.fromCharCode(code+n));
        }
    })
    
    return answer.join("");
}

콜라츠 추측

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

function solution(num) { 
    let answer = 0;
    
    while(answer < 501 && num !== 1 ){
        if(num % 2 === 0) {
            num = num / 2; 
            answer+=1;
        }else{
            num = (num * 3) + 1; 
            answer+=1;
        }
    }  

    return answer > 500 ? -1 : answer;
}

핸드폰 번호 가리기

function solution(phone_number) {
    let answer = Array(phone_number.length-4);
    answer.fill('*', 0, phone_number.length-4);
    answer = answer.join('');
    return answer + phone_number.slice(phone_number.length-4, phone_number.length);
}

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

문제 설명

---

내 코드

function solution(arr) {
    var answer = [];
    
    const tmp = Array.from(arr); // deep copy
    
    tmp.sort(function(a,b){
        return b - a;
    });
    
    const min = tmp.pop();
   
    arr = arr.filter((n) => n !== min)
    
    return arr.length === 0 ? [-1] : arr;
}