[yulrang] 25.01.02 (codingTestStd#5)

* Slice array / 기초

* Length of array items / 기초

* Shift array / 기초

* Number of duplicated item / 기초

* Remove lowest number / 중급

* Sum of matrix / 중급

* Multiple number / 중급

* Chore: 폴더명 변경경

Author: yulrang

yulrang/01_Array/01_Slice_array.js

@@ -0,0 +1,8 @@
+function solution(numbers, num1, num2) {
+  var answer = [];
+  
+  for(let i = num1; i <= num2; i++){
+      answer.push(numbers[i]);
+  }
+  return answer;
+}

yulrang/01_Array/02_Length_of_array_items.js

@@ -0,0 +1,9 @@
+function solution(strlist) {
+  var answer = [];
+  
+  for(let i=0; i<strlist.length; i++){
+      answer.push(strlist[i].length);    
+  }
+  
+  return answer;
+}

yulrang/01_Array/03_Shift_array.js

@@ -0,0 +1,16 @@
+function solution(numbers, direction) {
+  var answer = [];
+  if (direction === "left") {
+      for(let i=1; i<numbers.length; i++) {
+          answer.push(numbers[i])
+      }
+      answer.push(numbers[0]);
+  }
+  if (direction === "right") {
+      answer.push(numbers[numbers.length-1]);
+      for(let i=0; i<numbers.length-1; i++) {
+          answer.push(numbers[i])
+      }
+  }
+  return answer;
+}

yulrang/01_Array/04_Number_of_duplicated_item.js

@@ -0,0 +1,7 @@
+function solution(array, n) {
+  var answer = 0;
+  var filteredArr = array.filter((el) => el === n);
+  answer = filteredArr.length;
+  
+  return answer;
+}

yulrang/01_Array/05_Remove_lowest_number.js

@@ -0,0 +1,7 @@
+function solution(arr) {
+  if (arr.length === 1) {
+      return [-1];
+  }
+  
+  return arr.filter((el) => el !== Math.min(...arr));
+}

yulrang/01_Array/06_Sum_of_matrix.js

@@ -0,0 +1,12 @@
+function solution(arr1, arr2) {
+  var answer = new Array(arr1.length);
+  
+  for(let i=0; i<arr1.length; i++) {
+      answer[i] = new Array(arr1[i].length);
+      for(let j=0; j<arr1[i].length; j++) {
+          answer[i][j] = arr1[i][j] + arr2[i][j];
+      }
+  }
+  
+  return answer;
+}

yulrang/01_Array/07_Multiple_number.js

@@ -0,0 +1,12 @@
+function solution(arr, divisor) {
+  var answer = [];
+  
+  arr.forEach((el) => {
+      if(el % divisor === 0) answer.push(el);
+  })
+  answer.sort((a,b) => a-b);
+  
+  if(answer.length === 0) return [-1];
+  
+  return answer;
+}