Maximum Number of Operations on String

Problem Overview

• Compute the maximum number of operations on a lowercase string.
• Operation: choose three consecutive chars where the first two are equal and the third differs, then change the third to match.
• Input: string s (length up to 1e5); Output: integer count of operations.
• Domain: string manipulation and pattern replacement in a coding interview problem.
• Source: Mathworks interviews; common interview question.