Add solution #1503

JoshCrozier · JoshCrozier · commit 257c5319eb86 · 2025-04-16T12:22:32.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,332 LeetCode solutions in JavaScript
+# 1,333 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1148,6 +1148,7 @@
 1498|[Number of Subsequences That Satisfy the Given Sum Condition](./solutions/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js)|Medium|
 1499|[Max Value of Equation](./solutions/1499-max-value-of-equation.js)|Hard|
 1502|[Can Make Arithmetic Progression From Sequence](./solutions/1502-can-make-arithmetic-progression-from-sequence.js)|Easy|
+1503|[Last Moment Before All Ants Fall Out of a Plank](./solutions/1503-last-moment-before-all-ants-fall-out-of-a-plank.js)|Medium|
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
diff --git a/solutions/1503-last-moment-before-all-ants-fall-out-of-a-plank.js b/solutions/1503-last-moment-before-all-ants-fall-out-of-a-plank.js
@@ -0,0 +1,36 @@
+/**
+ * 1503. Last Moment Before All Ants Fall Out of a Plank
+ * https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/
+ * Difficulty: Medium
+ *
+ * We have a wooden plank of the length n units. Some ants are walking on the plank, each ant moves
+ * with a speed of 1 unit per second. Some of the ants move to the left, the other move to the
+ * right.
+ *
+ * When two ants moving in two different directions meet at some point, they change their directions
+ * and continue moving again. Assume changing directions does not take any additional time.
+ *
+ * When an ant reaches one end of the plank at a time t, it falls out of the plank immediately.
+ *
+ * Given an integer n and two integer arrays left and right, the positions of the ants moving to the
+ * left and the right, return the moment when the last ant(s) fall out of the plank.
+ */
+
+/**
+ * @param {number} n
+ * @param {number[]} left
+ * @param {number[]} right
+ * @return {number}
+ */
+var getLastMoment = function(n, left, right) {
+  let result = 0;
+
+  for (const pos of left) {
+    result = Math.max(result, pos);
+  }
+  for (const pos of right) {
+    result = Math.max(result, n - pos);
+  }
+
+  return result;
+};
