From aa3ab10ecf1cd1bbe360e8d7548b36ba0e96a335 Mon Sep 17 00:00:00 2001
From: dmswl6310 <dmswl6310@gmail.com>
Date: Thu, 27 Aug 2026 22:37:01 +0900
Subject: [PATCH] 0827

---
 .../4024. Nearest Available Drone.js"         | 24 +++++++++++++
 .../907. Sum of Subarray Minimums.js"         | 36 +++++++++++++++++++
 2 files changed, 60 insertions(+)
 create mode 100644 "leetcode3/\355\231\251\354\235\200\354\247\200/4024. Nearest Available Drone.js"
 create mode 100644 "leetcode3/\355\231\251\354\235\200\354\247\200/907. Sum of Subarray Minimums.js"

diff --git "a/leetcode3/\355\231\251\354\235\200\354\247\200/4024. Nearest Available Drone.js" "b/leetcode3/\355\231\251\354\235\200\354\247\200/4024. Nearest Available Drone.js"
new file mode 100644
index 00000000..7e27442a
--- /dev/null
+++ "b/leetcode3/\355\231\251\354\235\200\354\247\200/4024. Nearest Available Drone.js"	
@@ -0,0 +1,24 @@
+/**
+ * @param {number[][]} drones
+ * @param {number[]} target
+ * @return {number}
+ */
+var nearestDrone = function (drones, target) {
+  let min = Infinity;
+  let minIndex;
+
+  const targetX = target[0];
+  const targetY = target[1];
+
+  for (let i = 0; i < drones.length; i++) {
+    [x, y, range] = drones[i];
+    const dist = Math.abs(x - targetX) + Math.abs(y - targetY);
+    if (dist > range) continue;
+    if (dist < min) {
+      min = dist;
+      minIndex = i;
+    }
+  }
+
+  return min === Infinity ? -1 : minIndex;
+};
diff --git "a/leetcode3/\355\231\251\354\235\200\354\247\200/907. Sum of Subarray Minimums.js" "b/leetcode3/\355\231\251\354\235\200\354\247\200/907. Sum of Subarray Minimums.js"
new file mode 100644
index 00000000..7995493c
--- /dev/null
+++ "b/leetcode3/\355\231\251\354\235\200\354\247\200/907. Sum of Subarray Minimums.js"	
@@ -0,0 +1,36 @@
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var sumSubarrayMins = function (arr) {
+  let sum = 0;
+
+  for (let i = 0; i < arr.length; i++) {
+    let min = Infinity;
+    for (let j = i; j < arr.length; j++) {
+      min = Math.min(min, arr[j]);
+      sum = (sum + min) % (Math.pow(10, 9) + 7);
+    }
+  }
+
+  return sum;
+};
+
+// // a b c d
+// a ab abc abcd
+// b bc bcd
+// c cd
+// d
+
+// // a b
+// a<b
+// a+b+a
+
+// a>b
+// a+b+b
+
+// // a b c
+// a<b<c
+// a + b + c
+// a+ a+
+// b+