Available question text
Given a binary array, consider every split index i (0..n) and compute its score as zeros in the left part plus ones in the right part; return all indices with the maximum score. This is typically solved by tracking prefix zeros and remaining ones (or using prefix sums) to compute all scores in one pass.
Related questions
Continue with questions that share topics or the same question type.
- Find Score of an Array After Marking All Elements
Coding
- Find the Score of All Prefixes of an Array
Coding
- All Elements in Two Binary Search Trees
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
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 2155. All Divisions With the Highest Score of a Binary Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source