Skip to content

Practice Minimum Moves to Convert String

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#2027
LeetCode Problem

Minimum Moves to Convert String

StringGreedy

Problem Statement

You are given a string s consisting of n characters which are either 'X' or 'O'. A 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. Return the minimum number of moves required so that all the characters of s are converted to 'O'.

Source: Minimum Moves to Convert String on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "XXX"
Output
1

# Example 2

Input
s = "XXOX"
Output
2

# Example 3

Input
s = "OOOO"
Output
0

Constraints

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

Related LeetCode Problems

Practice more problems similar to Minimum Moves to Convert String.

44 Wildcard Matching Hard3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium8 String to Integer (atoi) Medium
← Previous Maximum Number of Ways to Partition an ArrayNext → Find Missing Observations

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free