Add solution #2270

Author: JoshCrozier

README.md

@@ -704,6 +704,7 @@
 2215|[Find the Difference of Two Arrays](./2215-find-the-difference-of-two-arrays.js)|Easy|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
+2270|[Number of Ways to Split Array](./2270-number-of-ways-to-split-array.js)|Medium|
 2300|[Successful Pairs of Spells and Potions](./2300-successful-pairs-of-spells-and-potions.js)|Medium|
 2336|[Smallest Number in Infinite Set](./2336-smallest-number-in-infinite-set.js)|Medium|
 2342|[Max Sum of a Pair With Equal Sum of Digits](./2342-max-sum-of-a-pair-with-equal-sum-of-digits.js)|Medium|

solutions/2270-number-of-ways-to-split-array.js

@@ -0,0 +1,32 @@
+/**
+ * 2270. Number of Ways to Split Array
+ * https://leetcode.com/problems/number-of-ways-to-split-array/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array nums of length n.
+ *
+ * nums contains a valid split at index i if the following are true:
+ * - The sum of the first i + 1 elements is greater than or equal to the sum of the
+ *   last n - i - 1 elements.
+ * - There is at least one element to the right of i. That is, 0 <= i < n - 1.
+ *
+ * Return the number of valid splits in nums.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var waysToSplitArray = function(nums) {
+  const total = nums.reduce((a, b) => a + b);
+  let result = 0;
+
+  for (let i = 0, sum = 0; i < nums.length - 1; i++) {
+    sum += nums[i];
+    if (sum >= total - sum) {
+      result++;
+    }
+  }
+
+  return result;
+};