[JustDevRae] 25.01.25 (#33)

* remove smallest number / 중급

* divisible numbers array / 중급

* duplicate number count / 기초

* matrix addition / 중급

* array element length / 기초

* rotate array / 기초

* slice array / 기초

* array algorithm md file

* reverse string / 기초

* control Z / 기초

* dart game / 중급

* valid parentheses / 중급

* crane claw game / 중급

* pair count / 기초

* find point position / 기초

* login success / 기초

* card bundle / 중급

* make hamburger / 중급

* process / 심화

* morse code / 기초

* make B with A / 기초

* setting order care / 기초

* not finish runner / 중급

* rank order / 기초

Author: JustDevRae

JustDevRae/Hash/make_B_with_A.js

@@ -0,0 +1,21 @@
+function solution(before, after) {
+  var answer = 0;
+  const beforeCount = {};
+  const afterCount = {};
+
+  for (const char of before) {
+    beforeCount[char] = (beforeCount[char] || 0) + 1;
+  }
+
+  for (const char of after) {
+    afterCount[char] = (afterCount[char] || 0) + 1;
+  }
+
+  for (const key in beforeCount) {
+    if (beforeCount[key] !== afterCount[key]) {
+      return (answer = 0);
+    }
+  }
+
+  return (answer = 1);
+}

JustDevRae/Hash/morse_code.js

@@ -0,0 +1,37 @@
+function solution(letter) {
+  var answer = "";
+  const morse = {
+    ".-": "a",
+    "-...": "b",
+    "-.-.": "c",
+    "-..": "d",
+    ".": "e",
+    "..-.": "f",
+    "--.": "g",
+    "....": "h",
+    "..": "i",
+    ".---": "j",
+    "-.-": "k",
+    ".-..": "l",
+    "--": "m",
+    "-.": "n",
+    "---": "o",
+    ".--.": "p",
+    "--.-": "q",
+    ".-.": "r",
+    "...": "s",
+    "-": "t",
+    "..-": "u",
+    "...-": "v",
+    ".--": "w",
+    "-..-": "x",
+    "-.--": "y",
+    "--..": "z",
+  };
+  const str = letter.split(" ");
+
+  for (const s of str) {
+    answer += morse[s];
+  }
+  return answer;
+}

JustDevRae/Hash/not_finish_runner.js

@@ -0,0 +1,21 @@
+function solution(participant, completion) {
+  const obj = {};
+
+  for (const p of participant) {
+    if (obj[p]) {
+      obj[p] += 1;
+    } else {
+      obj[p] = 1;
+    }
+  }
+
+  for (const c of completion) {
+    obj[c] -= 1;
+  }
+
+  for (const key in obj) {
+    if (obj[key] > 0) {
+      return key;
+    }
+  }
+}

JustDevRae/Hash/rank_order.js

@@ -0,0 +1,6 @@
+function solution(score) {
+  const averages = score.map(([english, math]) => (english + math) / 2);
+  const sortedAverages = [...averages].sort((a, b) => b - a);
+
+  return averages.map((avg) => sortedAverages.indexOf(avg) + 1);
+}

JustDevRae/Hash/setting_order_care.js

@@ -0,0 +1,10 @@
+function solution(emergency) {
+  const sorted = [...emergency].sort((a, b) => b - a);
+  const rankMap = new Map();
+
+  sorted.forEach((value, index) => {
+    rankMap.set(value, index + 1);
+  });
+
+  return emergency.map((value) => rankMap.get(value));
+}