Studying programming

Solution in Javascript const p = [4, 2, 5, 1, 3]; function permutationEquation(p) { const arr=[]; for (let i = 1; i

Solution in JavaScript const n = 5; function utopianTree(n) { let cycle = 1; let height = 1; while (cycle

Solution I in Javascript const keyboards = [3, 1]; const drives = [5, 2, 8]; const b = 10; function getMoneySpent(keyboards, drives, b) { let valid = []; keyboards.forEach(k => drives.forEach(d => k + d //1. reduce: arrow function 이용 single value return. //2. max: 조건에 맞게 max value를 리턴. //3. map: 함수이용 each elements 변화시킨다. -> drives와 keyboards each elements 더하기. //4. 합한 값을 budget보다 작거나 같은 값으로 filt..