Available question text
Given a binary string, choose a split into two non-empty substrings to maximize the sum of zeros in the left part and ones in the right part; compute the maximum score over all split positions (can be done by scanning with prefix/suffix counts).
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 1422. Maximum Score After Splitting a String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source