You are given a string s consisting of characters 'X' and 'O'.

In one move, you can select $3$ consecutive characters of s and convert all of them into 'O'.

Return the minimum number of moves needed to convert all characters in s into 'O'.

Note: If a selected group of $3$ consecutive characters already contains 'O', those characters remain 'O'.

Constraints:

• $3 \leq$ s.length $\leq 1000$

• s[i] is either 'X' or 'O'.

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.