Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2270. Number of Ways to Split Array
Count the number of split indices i (0 ≤ i < n-1) such that the prefix sum up to i is at least the suffix sum to its right — equivalently, count prefixes where 2 * prefix_sum >= total_sum. Compute the total once and scan prefixes to tally these indices in O(n).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.