Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2270. Number of Ways to Split Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source