You are given a $0$ indexed binary string target of length n.

You have another binary string s of length n, where all characters are initially '0'. You want to make s equal to target.

In one operation, you can choose an index i such that $0 \leq i < n$ and flip all the characters in s from index i to index $n - 1$ inclusive. Flipping changes '0' to '1' and '1' to '0'.

Return the minimum number of operations needed to make s equal to target.

Constraints:

• n == target.length

• $1 \leq$ n $\leq 10^5$

• target[i] is either '0' or '1'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.