Link코딩테스트 연습 - 실패율 문제풀이(1)function solution(N, stages) { let arr = new Array(N + 2).fill(0) for (let s of stages) { arr[s] += 1; } let total = stages.length; let pre = 0; let fail = [] for (let i = 1; i b[1] - a[1] || a[0] - b[0]) return fail.map(f => f[0]);}

Link코딩테스트 연습 - 덧칠하기 문제풀이(1)function solution(n, m, section) { let answer = 0; let s = 1; for (let i = 0; i

Link코딩테스트 연습 - 소수 만들기 문제풀이(1)function solution(nums) { let answer = 0; nums.sort((a, b) => b - a); //console.log(nums) const max = nums[0] + nums[1] + nums[2]; let primes = new Array(max + 1).fill(true); primes[0] = false primes[1] = false for (let i = 2; i * i (2)function isPrime(num) { if (num

Linkhttps://school.programmers.co.kr/learn/courses/30/lessons/12921 문제풀이(1)function solution(n) { let answer = 0; for (let i = 2; i (2)function solution(n) { let primes = new Array(n + 1).fill(true); primes[0] = primes[1] = false; // 0과 1은 소수가 아님 for (let i = 2; i * i v).length;}간단 해설풀이(1) 은 타임아웃이 발생함. O(n 루트 n)풀이(2) 는 에라토스테네스의 체 활용. O(n 로그 로그 n)주의점

Link과일 장수 문제풀이(1)function solution(k, m, score) { let answer = 0; score.sort((a, b) => b - a); for (let i = 0; i

Link코딩테스트 연습 - 모의고사 문제풀이(1)function solution(answers) { let answer = [0, 0, 0]; let len = answers.length; let one = '12345'.repeat(Math.ceil(len / 5)).split('').map(Number); let two = '21232425'.repeat(Math.ceil(len / 8)).split('').map(Number); let three = '3311224455'.repeat(Math.ceil(len / 10)).split('').map(Number); for (let i = 0; i (m === max ? i + 1 : null)).filt..

Link코딩테스트 연습 - 2016년 문제풀이(1)function solution(a, b) { const DATE = ['SUN','MON','TUE','WED','THU','FRI',"SAT"]; const day = new Date(2016, a - 1, b); return DATE[day.getDay()]} 주의점let date = new Date();console.log(date.getFullYear()); // Yearconsole.log(date.getMonth()); // Month (0-11)console.log(date.getDate()); // Day of the month (1-31)console.log(date.getDay()); ..

Link코딩테스트 연습 - 기사단원의 무기 문제풀이(1)function solution(number, limit, power) { return Array .from({length: number}, (_, i) => i + 1) .map(m => { if (m === 1) return 1; let cnt = 0; let sqrt = Math.sqrt(m); for (let i = 1; i limit ? power : cnt; }) .reduce((sum, val) => sum += val, 0);}

Link코딩테스트 연습 - 폰켓몬 문제풀이(1)function solution(nums) { let half = Math.floor(nums.length / 2); let types = new Set(nums) //return types.size > half ? half : types.size; return Math.min(types.size, half);}

Link코딩테스트 연습 - 추억 점수 문제풀이(1)function solution(name, yearning, photo) { let answer = []; for (let i = 0; i -1) answer[i] += yearning[j]; } } return answer;}(2)function solution(name, yearning, photo) { return photo.map(group => group.reduce((sum, person) => sum + (yearning[name.indexOf(person)] || 0), 0) );}