Binary String Codeforces Solution | Codeforces Problem Solution 2022

Binary String Codeforces Solution | Codeforces Problem Solution 2022

C. Binary String

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

You are given a string 𝑠$s$ consisting of characters 0 and/or 1.

You have to remove several (possibly zero) characters from the beginning of the string, and then several (possibly zero) characters from the end of the string. The string may become empty after the removals. The cost of the removal is the maximum of the following two values:

• the number of characters 0 left in the string;
• the number of characters 1 removed from the string.

Solution Click Below:-  CLICK HERE

What is the minimum cost of removal you can achieve?

Input

The first line contains one integer 𝑡$t$ (1≤𝑡≤104$1\le t\le {10}^4$) — the number of test cases.

Minimums and Maximums Codeforces Solution 

Robots Codeforces Solution 

Binary String Codeforces Solution

Dog Walking Codeforces Solution

Moving Chips Codeforces Solution

Lenient Vertex Cover Codeforces Solution 

Each test case consists of one line containing the string 𝑠$s$ (1≤|𝑠|≤2⋅105$1\le |s|\le 2\cdot {10}^5$), consisting of characters 0 and/or 1.

The total length of strings 𝑠$s$ in all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Output

For each test case, print one integer — the minimum cost of removal you can achieve.

Join Now for Solution:-