Minimum Moves to Convert String solution leetcode

Minimum Moves to Convert String solution leetcode

You are given a string s consisting of n characters which are either 'X' or 'O'.

move is defined as selecting three consecutive characters of s and converting them to 'O'. Note that if a move is applied to the character 'O', it will stay the same. Minimum Moves to Convert String solution leetcode

Return the minimum number of moves required so that all the characters of s are converted to 'O'.

 

Minimum Moves to Convert String solution leetcode

Input: s = "XXX"
Output: 1
Explanation: XXX -> OOO
We select all the 3 characters and convert them in one move.

Example 2:

Input: s = "XXOX"
Output: 2
Explanation: XXOX -> OOOX -> OOOO
We select the first 3 characters in the first move, and convert them to 'O'. Then we select the last 3 characters and convert them so that the final string contains all 'O's.

Minimum Moves to Convert String solution leetcode

Input: s = "OOOO"
Output: 0
Explanation: There are no 'X's in s to convert.

 

Minimum Moves to Convert String solution leetcode

  • 3 <= s.length <= 1000
  • s[i] is either 'X' or 'O'.
  • For Solution

    Click Here!

Leave a Comment