솔루션 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; };

솔루션 const solution = (quiz) => { const answer = quiz.map((v) => { const [formula, answer] = v.split("="); return eval(formula) === +answer ? "O" : "X"; }); console.log(answer); return answer; };

솔루션 const solution = (array) => { const answer = [...array.join("")].filter((v) => v === "7").length; console.log(answer); return answer; }; 솔루션 const solution2 = (array) => { const answer = array.join("").split("7").length - 1; console.log(answer); return answer; };

솔루션1 const solution = (my_str, n) => { const answer = []; for (let i = 0; i { const answer = my_str.match(new RegExp(`.{1,${n}}`, "g")); // 정규식 이용 console.log(answer); return answer; }; 정규식은 진짜 볼때마다 새롭고 짜릿하고 내 고사..

솔루션1 const solution = (A, B) => { const pushRight = (str) => [str[str.length - 1], ...str.slice(0, str.length - 1)].join(""); for (let i = 0; i { /** * String.prototype.indexOf() : String 객체에서 주어진 값과 일치하는 첫 번째 인덱스를 반환 * * 일치하는 값이 없으면 -1 반환 */ const answer = (B + B).indexOf(A); console.log(answer); return answer; }; 솔루션2가 대박인 거 같다. 아직 난 멀었다...