Add solution #1413

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,288 LeetCode solutions in JavaScript
+# 1,289 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1079,6 +1079,7 @@
 1409|[Queries on a Permutation With Key](./solutions/1409-queries-on-a-permutation-with-key.js)|Medium|
 1410|[HTML Entity Parser](./solutions/1410-html-entity-parser.js)|Medium|
 1411|[Number of Ways to Paint N × 3 Grid](./solutions/1411-number-of-ways-to-paint-n-3-grid.js)|Hard|
+1413|[Minimum Value to Get Positive Step by Step Sum](./solutions/1413-minimum-value-to-get-positive-step-by-step-sum.js)|Easy|
 1415|[The k-th Lexicographical String of All Happy Strings of Length n](./solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js)|Medium|
 1422|[Maximum Score After Splitting a String](./solutions/1422-maximum-score-after-splitting-a-string.js)|Easy|
 1431|[Kids With the Greatest Number of Candies](./solutions/1431-kids-with-the-greatest-number-of-candies.js)|Easy|

solutions/1413-minimum-value-to-get-positive-step-by-step-sum.js

@@ -0,0 +1,29 @@
+/**
+ * 1413. Minimum Value to Get Positive Step by Step Sum
+ * https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums, you start with an initial positive value startValue.
+ *
+ * In each iteration, you calculate the step by step sum of startValue plus elements in
+ * nums (from left to right).
+ *
+ * Return the minimum positive value of startValue such that the step by step sum is never
+ * less than 1.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minStartValue = function(nums) {
+  let minSum = 0;
+  let currentSum = 0;
+
+  for (const num of nums) {
+    currentSum += num;
+    minSum = Math.min(minSum, currentSum);
+  }
+
+  return Math.max(1, 1 - minSum);
+};