dev-resources.site
for different kinds of informations.
No of ways to split Array
Published at
1/3/2025
Categories
rangequeries
dsa
leetcode
prefixsum
Author
prashantrmishra
Author
15 person written this
prashantrmishra
open
TC: O(n) for calculating prefix sum, and O(n) for iterating over the prefix sum for calculating valid splits
class Solution {
public int waysToSplitArray(int[] nums) {
long prefix[] = new long[nums.length];
long current = 0;
for(int i=0;i<nums.length;i++){
current+=nums[i];
prefix[i] = current;
}
int count =0;
for(int i =0;i<nums.length-1;i++){
long left = prefix[i];
long right = prefix[nums.length-1];
if(left>=right-left) count++;
}
return count;
}
}
Featured ones: