Merge pull request #2172 from CodingTestStudy2/정진영

[정진영] 2026/10/13

Author: github-actions[bot]

leetcode3/정진영/1094. Car Pooling

@@ -0,0 +1,27 @@
+/**
+ * @param {number[][]} trips
+ * @param {number} capacity
+ * @return {boolean}
+ */
+var carPooling = function(trips, capacity) {
+    // trips[i] = [numPassengers, from, to]
+    // nP 승객이 from에서 타서 to에서 내림
+    let arr = new Array(1000).fill(0);
+    for (let i = 0; i<trips.length; i++){
+        let nP = trips[i][0];
+        let from = trips[i][1];
+        let to = trips[i][2];
+
+        arr[from] += nP;
+        arr[to] -= nP;
+    }
+    
+    let count = 0;
+    for (let j = 0; j < arr.length; j++){
+        count += arr[j];
+        if (count > capacity) {
+            return false;
+        } 
+    }
+    return true;
+};

leetcode3/정진영/4061. Minimum Queen Moves to Reach Target

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} source
+ * @param {number[]} target
+ * @return {number}
+ */
+var minQueenMoves = function(source, target) {
+    // 8x8
+    // 같은 좌표: 0
+    // 대각선 라인, 같은 행, 열: 1
+    // else: 2
+    if (source[0] == target[0] && source[1] == target[1]) {
+        return 0;
+    } if (
+        (Math.abs(source[0] - target[0]) == Math.abs(source[1] - target[1])) || (source[0] == target[0] && source[1] !== target[1]) || 
+        (source[0] !== target[0] && source[1] == target[1])
+        ) return 1;
+    
+    return 2;
+};