You are given a string s and a printer that works in turns. In one turn, the printer selects a contiguous segment of s and prints a single lowercase letter across the entire segment. Any characters already present in that segment are overwritten.

Return the minimum number of turns needed to print s starting from an initially empty string.

Note: The printer can overwrite previously printed characters.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s consists of lowercase English letters.

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.