Minimum Moves to Convert String Problem

Minimum Moves to Convert String Problem — ExecCode Easy DSA Practice

Solve the Minimum Moves to Convert String problem on ExecCode. Free online easy DSA practice in String. Write and run code in Java, C++, Python — no signup required to run.

Description 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 minimu…

Practice Minimum Moves to Convert String free on ExecCode. Browse more ExecCode DSA problems.