> 기초/코테 연습
-
TIL-2024.08.14-programmers-lv2-87390.n^2 배열 자르기> 기초/코테 연습 2024. 8. 14. 23:49
URL: https://school.programmers.co.kr/learn/courses/30/lessons/87390?language=javascript CODE: // URL > https://school.programmers.co.kr/learn/courses/30/lessons/87390const solution = (n, left, right) => { // 방안 1. 2차원 배열에서 전체 값 찾기 > 시간초과 // const resultArr = Array.from({ length: n }, () => Array(n).fill(-1)); // // for (let i = 0; i = j ? i + 1 : j + 1; // } // } // return resultArr.flat().sl..
-
TIL-2024.08.11-programmers-lv2-12949.행렬곱셈> 기초/코테 연습 2024. 8. 12. 19:50
URLhttps://school.programmers.co.kr/learn/courses/30/lessons/12949 CODE // URL > https://school.programmers.co.kr/learn/courses/30/lessons/12949const solution = (arr1, arr2) => { const rows1 = arr1.length; const cols1 = arr1[0].length; const rows2 = arr2.length; const cols2 = arr2[0].length; // 결과 행렬의 크기 const result = Array.from({ length: rows1 }, () => Array(cols2).fill(0));..
-
TIL-2024.08.11-programmers-lv2-118667.두 큐 합 같게 만들기(feat.kakao)> 기초/코테 연습 2024. 8. 11. 12:32
URL: https://school.programmers.co.kr/learn/courses/30/lessons/118667 CODE: // URL >const solution = (queue1, queue2) => { let sum1 = queue1.reduce((acc, cur) => acc += cur); let sum2 = queue2.reduce((acc, cur) => acc += cur); let target = ( sum1 + sum2 ) / 2; const maxCount = (queue1.length) * 2 + 1; let count = 0; const flag = queue1.concat(queue2).filter(item => item > target); if (flag.leng..
-
TIL-2024.08.08-programmers-lv2-42586.기능개발> 기초/코테 연습 2024. 8. 8. 23:32
URLhttps://school.programmers.co.kr/learn/courses/30/lessons/42586 CODE // URL > https://school.programmers.co.kr/learn/courses/30/lessons/42586const solution = (progresses, speeds) => { let resultArr = []; const tempArr = progresses.map((item, i) => Math.ceil(( 100 - progresses[i] ) / speeds[i])); let point = -1; let count = 0; for (let i = 0; i = tempArr[i]) { count += 1; } else { resultA..
-
TIL-2024.07.25-programmers-lv2-12985.예상대진표> 기초/코테 연습 2024. 7. 25. 23:24
URL https://school.programmers.co.kr/learn/courses/30/lessons/12985 CODE// URL > https://school.programmers.co.kr/learn/courses/30/lessons/12985const solution = (n, a, b) => { if (n === 2) return 1; let count = 0 while (a !== b) { a = Math.ceil(a / 2); b = Math.ceil(b / 2); count++; } return count;};console.log("result:: ", solution(8, 4, 7)); //3
-
TIL-2024.07.24-programmers-lv2-12914.멀리뛰기> 기초/코테 연습 2024. 7. 24. 09:38
URL https://school.programmers.co.kr/learn/courses/30/lessons/12914 CODE// URL > https://school.programmers.co.kr/learn/courses/30/lessons/12914const solution = (n) => { const MOD = 1234567; // 기본적인 경우 if (n === 1) return 1; if (n === 2) return 2; let dp = new Array(n + 1).fill(0); dp[1] = 1; dp[2] = 2; for (let i = 3; i
-
TIL-2024.07.23 - programmers-lv2 - 점프와 순간이동> 기초/코테 연습 2024. 7. 23. 22:57
URLhttps://school.programmers.co.kr/learn/courses/30/lessons/12980 CODE// URL > https://school.programmers.co.kr/learn/courses/30/lessons/12980const solution = (n) => { let totalBatteryUsage = 1; while (n !== 1) { if (n % 2 === 0) n /= 2; else { n -= 1; totalBatteryUsage += 1; } } return totalBatteryUsage;};console.log("result:: ", solution(5)); //2console.log("result:: ", solution(6)); ..
-
TIL-2024.06.20 - CodingTest - 귤> 기초/코테 연습 2024. 6. 20. 00:19
URL:https://school.programmers.co.kr/learn/courses/30/lessons/12953 코드:// URL > https://school.programmers.co.kr/learn/courses/30/lessons/138476const solution = (k, tangerine) => { let count = 0; let tanMap = new Map(); tangerine.forEach(item => { if (tanMap.get(item)) { tanMap.set(item, tanMap.get(item) + 1); } else { tanMap.set(item, 1); } ..