Merge branch 'main' into main

Author: codeisneverodd

README.md

@@ -0,0 +1,10 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(num_list, n) {
+  let result = [];
+  for (let i = 0; i < num_list.length / n; i++) {
+    result = [...result, num_list.slice(i * n, i * n + n)];
+  }
+  return result;
+}

level-0/2차원으로-만들기&120842&.js

@@ -0,0 +1,6 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(order) {
+  return [...('' + order)].filter(num => num === '3' || num === '6' || num === '9').length;
+}

level-0/369게임&120891&.js

@@ -0,0 +1,6 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(array) {
+  return [...array.join('')].filter(a => a === '7').length;
+}

level-0/7의-개수&120912&.js

@@ -0,0 +1,7 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(before, after) {
+  const sort = str => [...str].sort((a, b) => (a < b ? -1 : a !== b ? 1 : 0)).join('');
+  return sort(before) === sort(after) ? 1 : 0;
+}

level-0/A로-B-만들기&120886&.js

@@ -0,0 +1,9 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(quiz) {
+  return quiz.map(q => {
+    const [formula, answer] = q.split('=');
+    return eval(formula) === +answer ? 'O' : 'X';
+  });
+}

level-0/OX퀴즈&120907&.js

@@ -0,0 +1,10 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(i, j, k) {
+  let count = 0;
+  for (let num = i; num <= j; num++) {
+    count += [...('' + num)].filter(n => +n === k).length;
+  }
+  return count;
+}

level-0/k의-개수&120887&.js

@@ -0,0 +1,6 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(n, numlist) {
+  return numlist.filter(num => num % n === 0);
+}

level-0/n의-배수-고르기&120905&.js

@@ -0,0 +1,7 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(array, n) {
+  const minDiff = Math.min(...array.map(a => Math.abs(a - n)));
+  return array.sort((a, b) => a - b).find(a => Math.abs(a - n) === minDiff);
+}

level-0/가까운-수&120890&.js

@@ -0,0 +1,7 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(rsp) {
+  const win = { 0: 5, 2: 0, 5: 2 };
+  return [...rsp].map(num => win[num]).join('');
+}