솔루션 const solution = (s1, s2) => { const answer = s1.filter((v) => s2.includes(v)).length; console.log(answer); return answer; }; 솔루션 function solution2(s1, s2) { let answer = 0; for (var i = 0; i < s1.length; i++) { for (var j = 0; j < s2.length; j++) { if (s1[i] === s2[j]) answer++; } } console.log(answer); return answer; }

솔루션 const solution = (num, k) => { const answer = [...("" + num)].findIndex((v) => +v === k); console.log(answer); return answer === -1 ? -1 : answer + 1; }; 솔루션 const solution2 = (num, k) => { const answer = num.toString(); if (answer.includes(k)) { return answer.indexOf(k) + 1; } else { return -1; } };

솔루션 const solution = (n, numlist) => { const answer = []; for (let i = 0; i { const answer = numlist.filter((v) => v % n === 0); console.log(answer); return answer; };

솔루션 const solution = (n) => { const answer = [...("" + n)].map((v) => +v).reduce((x, y) => x + y, 0); console.log(answer); return answer; }; 솔루션 const solution2 = (n) => { const answer = n .toString() .split("") .reduce((x, y) => x + Number(y), 0); console.log(answer); return answer; };

솔루션 const solution = (str1, str2) => { const answer = str1.includes(str2) ? 1 : 2; console.log(answer); return answer; }; 솔루션 const solution2 = (str1, str2) => { const answer = str1.split(str2).length > 1 ? 1 : 2; console.log(answer); return answer; };

솔루션 const solution = (n) => { const answer = Number.isInteger(Math.sqrt(n)) ? 1 : 2; console.log(answer); return answer; };

솔루션 const solution = (n, t) => { const answer = n * 2 ** t; console.log(answer); return answer; }; 솔루션 const solution2 = (n, t) => { console.log(n 0) { n *= 2; } console.log(n); return n; }; 솔루션 const solution4 = (n, t) => { const answer = n * Math.pow(2, t); console.log(answer); return answer; };

솔루션 const solution = (my_string) => { const answer = [...my_string] .map((v) => v.toLowerCase()) .sort((a, b) => (a b ? 1 : 0)) .join(""); console.log(answer); return answer; };