Zeros Left, Ones Right

Easy

You are given a string bits made of 0 and 1. Cut it in one place into two non-empty parts, a left one and a right one. The cut scores the number of zeros in the left part plus the number of ones in the right part. Return the highest score you can get.

Example 1

bits='010011' → 5

Cut after "0100": three zeros on the left and two ones on the right, 5 in total. Nothing scores higher.

Example 2

bits='000' → 2

There are no ones, and the right part cannot be empty, so the left part holds at most two zeros.

Example 3

bits='10' → 0

Constraints

2 ≤ len(bits) ≤ 500
bits contains only the characters 0 and 1

Have you seen this problem in a real interview?

Solved by0

Tried by0

Submissions0

Acceptance—

Topics

String Prefix Sum

Similar problems

Roll Letters by Prefix Medium Up and Down Orderings Hard Palindrome After a Few Fixes Medium Matching Stretch Within Budget Medium Even Vowel Stretch Medium

Input

bits='010011'

Expected

Run checks the first 3 tests in your browser. Submit checks all 146 tests on the server, hidden ones included.