feat: 정답률 낮은 문제 순으로 문제 풀이 추가

Author: Jetom88

Diff for: level-0/n의-배수-고르기.js

@@ -0,0 +1,10 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(n, numlist) {
+  let result = [];
+  for (let i = 0; i < numlist.length; i++) {
+    if (numlist[i] % n === 0) result.push(numlist[i]);
+  }
+  return result;
+}

Diff for: level-0/가위-바위-보.js

@@ -0,0 +1,15 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(rsp) {
+  const str = rsp.split('');
+  let result = [];
+
+  for (let i = 0; i < str.length; i++) {
+    if (str[i] === '2') result.push('0');
+    else if (str[i] === '0') result.push('5');
+    else result.push('2');
+  }
+
+  return result.join('');
+}

Diff for: level-0/배열-두-배-만들기.js

@@ -0,0 +1,10 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(numbers) {
+  let result = [];
+  for (let i = 0; i < numbers.length; i++) {
+    result.push(numbers[i] * 2);
+  }
+  return result;
+}

Diff for: level-0/배열-원소의-길이.js

@@ -0,0 +1,12 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(strlist) {
+  let result = [];
+
+  for (let i = 0; i < strlist.length; i++) {
+    result.push(strlist[i].length);
+  }
+
+  return result;
+}

Diff for: level-0/배열의-평균값.js

@@ -0,0 +1,6 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(numbers) {
+  return numbers.reduce((acc, cur) => acc + cur) / numbers.length;
+}

Diff for: level-0/숨어있는-숫자의-덧셈-(1).js

@@ -0,0 +1,12 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(my_string) {
+  const num = my_string.split('');
+  let result = 0;
+
+  for (let i = 0; i < num.length; i++) {
+    if (Number(num[i])) result += Number(num[i]);
+  }
+  return result;
+}

Diff for: level-0/약수-구하기.js

@@ -0,0 +1,11 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(n) {
+  let result = [];
+
+  for (let i = 1; i <= n; i++) {
+    if (n % i === 0) result.push(i);
+  }
+  return result;
+}

Diff for: level-0/양꼬치.js

@@ -0,0 +1,6 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(n, k) {
+  return n * 12000 + (k * 2000 - Math.floor(n / 10) * 2000);
+}

Diff for: level-0/자릿수-더하기.js

@@ -0,0 +1,11 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(n) {
+  const str = String(n).split('');
+  let number = 0;
+
+  str.map(num => (number += Number(num)));
+
+  return number;
+}

Diff for: level-0/중복된-숫자-개수.js

@@ -0,0 +1,8 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(array, n) {
+  const result = array.filter(num => num === n);
+
+  return result.length;
+}

Diff for: level-0/짝수-홀수-개수.js

@@ -0,0 +1,15 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(num_list) {
+  const even = [];
+
+  const oddNumber = [];
+
+  let result = [];
+  for (let i = 0; i < num_list.length; i++) {
+    if (num_list[i] % 2 === 0) even.push(num_list[i]);
+    else oddNumber.push(num_list[i]);
+  }
+  return (result = [even.length, oddNumber.length]);
+}

Diff for: level-0/짝수는-싫어요.js

@@ -0,0 +1,11 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(n) {
+  let result = [];
+  for (let i = 1; i <= n; i++) {
+    if (i % 2 === 1) result.push(i);
+  }
+
+  return result;
+}

Diff for: level-0/최댓값-만들기(1).js

@@ -0,0 +1,12 @@
+//https://github.com./codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - jetom88
+function solution(numbers) {
+  let findNum = [];
+
+  for (let i = 0; i < numbers.length - 1; i++) {
+    findNum.push(numbers[i] * numbers[i + 1]);
+  }
+  const max = Math.max(...findNum);
+  return max;
+}