[Add] Programmers_2022

Author: Joie-Kim

Programmers_2022/jun3Q1.js

@@ -0,0 +1,21 @@
+// link: https://programmers.co.kr/learn/courses/30/lessons/49994
+
+function solution(dirs) {
+  const move = { U: [0, 1], D: [0, -1], R: [1, 0], L: [-1, 0] };
+  let curPoint = [0, 0];
+  let visited = new Set();
+
+  for (let dir of dirs) {
+    const nextX = curPoint[0] + move[dir][0];
+    const nextY = curPoint[1] + move[dir][1];
+
+    if (Math.abs(nextX) > 5 || Math.abs(nextY) > 5) continue;
+
+    visited.add('' + curPoint[0] + curPoint[1] + nextX + nextY);
+    visited.add('' + nextX + nextY + curPoint[0] + curPoint[1]);
+
+    curPoint = [nextX, nextY];
+  }
+
+  return visited.size / 2;
+}

Programmers_2022/jun3Q2.js

@@ -0,0 +1,19 @@
+// link: https://programmers.co.kr/learn/courses/30/lessons/43165
+
+function solution(numbers, target) {
+  let answer = 0;
+
+  function dfs(sum, index) {
+    if (index === numbers.length) {
+      if (sum === target) answer += 1;
+      return;
+    }
+
+    dfs(sum + numbers[index], index + 1);
+    dfs(sum - numbers[index], index + 1);
+  }
+
+  dfs(0, 0);
+
+  return answer;
+}

Programmers_2022/jun3Q3.js

@@ -0,0 +1,12 @@
+// link: https://programmers.co.kr/learn/courses/30/lessons/12973
+
+function solution(s) {
+  let stack = [];
+
+  for (let i = 0; i < s.length; i++) {
+    if (!stack.length || stack[stack.length - 1] !== s[i]) stack.push(s[i]);
+    else stack.pop();
+  }
+
+  return stack.length ? 0 : 1;
+}