#2270 - Number of Ways to Split Array

Medium • View on LeetCode • View on GitHub

Problem Description

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.

Solution

/**
 * @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;
};