Minimize Overwriting Turns of a Single-Character Printer

### Problem A printer turn chooses one contiguous interval and writes the same chosen character throughout it, overwriting any existing characters. Return the fewest turns needed to produce s from an initially blank string of its length. ```cpp class Solution { public: int strangePrinter(string s); }; ``` ### Examples **Example 1:** ```text s = "cac" Output: 2 Explanation: Print ccc, then overwrite its middle with a. ``` **Example 2:** ```text s = "abcd" Output: 4 Explanation: Each distinct final character needs its own printing turn. ``` ### Constraints - Target size: 1..100 characters, all English lowercase. ### Clarifying Questions Allow overwriting and justify how separated equal characters can share a printing turn. ```hint Read the boundary condition Could two equal endpoint characters be supplied by one turn before the middle is repaired? ``` ### Contract considerations Allow overwriting and justify how separated equal characters can share a printing turn.