Merge pull request #66 from front-studium/Insung-Jo

`week11` `week12` `week13` `week14` 풀었습니다

Author: Insung-Jo

Insung-Jo/level_0/뒤집힌 문자열.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return my_string.split("").reverse().join("");
+}

Insung-Jo/level_0/문자 반복 출력하기.js

@@ -0,0 +1,14 @@
+function solution(my_string, n) {
+  let answer = my_string.split("");
+  let result = [];
+
+  for (let i = 0; i < answer.length; i++) {
+    result = answer[i];
+    for (let j = 0; j < n - 1; j++) {
+      answer[i] += result;
+    }
+  }
+  let num1 = answer.join("");
+
+  return num1;
+}

Insung-Jo/level_0/배열 뒤집기.js

@@ -0,0 +1,3 @@
+function solution(num_list) {
+  return num_list.reverse();
+}

Insung-Jo/level_0/배열의 평균값.js

@@ -0,0 +1,6 @@
+function solution(numbers) {
+  let sum = 0;
+  numbers.forEach((number) => (sum += number));
+  const result = sum / numbers.length;
+  return result;
+}

Insung-Jo/level_0/제곱수 판별하기.js

@@ -0,0 +1,6 @@
+function solution(n) {
+  const result = Math.sqrt(n);
+
+  if (n % result === 0) return 1;
+  return 2;
+}

Insung-Jo/level_0/짝수 홀수 개수.js

@@ -0,0 +1,9 @@
+function solution(num_list) {
+  var answer = num_list;
+  const even = answer.filter((num) => num % 2 === 0).length;
+  const odd = answer.filter((num) => num % 2 === 1).length;
+
+  const result = [even, odd];
+
+  return result;
+}

Insung-Jo/level_0/특정 문자 제거하기.js

@@ -0,0 +1,12 @@
+function solution(my_string, letter) {
+  let answer = my_string.split("");
+
+  for (let i = 0; i < answer.length; i++) {
+    if (answer[i] === letter) {
+      answer.splice(i, 1);
+      i--;
+    }
+  }
+  answer = answer.join("");
+  return answer;
+}

Insung-Jo/level_0/편지.js

@@ -0,0 +1,3 @@
+function solution(message) {
+  return message.length * 2;
+}