Leetcode 1422. Maximum Score After Splitting a String

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1422. Maximum Score After Splitting a String

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact