Minimum Operations To Equalize Binary String · Interview Problem

Back to problems

Leetcode

minimum-operations-to-equalize-binary-string

Medium

Strings

Greedy

Minimum Operations To Equalize Binary String

Given a binary string, find the minimum number of operations to make all characters equal.

Acceptance 40%

Start Practice

Also Available On

Other platform versions and source mappings for the same problem.

Minimum Operations to Make Binary String Equal

gfg

Problem Statement

Core description from the backend problem record.

Description

You are given a binary string s (a string consisting of characters '0' and '1'). In one operation, you can flip a character (change '0' to '1' or '1' to '0'). Your goal is to find the minimum number of operations required to make all characters in the string equal (all '0's or all '1's). Return the minimum number of operations needed.

Input Format

A single line containing the binary string s.

Output Format

An integer representing the minimum number of flips required to make all characters equal.

Constraints

1 <= s.length <= 10^5 s consists only of '0' and '1' characters.

Examples

Sample cases returned by the problem API.

Example 1

Input

Output

Explanation

Flip the two '1's at positions 3 and 4 to '0's, resulting in "00000".

Example 2