Simple C# solution
Approach\nIf you find \'O\' jump to next letter.\nIf you find \'X\' ignore the next two letters and to the third next and count that as a move.\n\n# Complexity\
# Approach\nIf you find \'O\' jump to next letter.\nIf you find \'X\' ignore the next two letters and to the third next and count that as a move.\n\n# Complexity\n- Time complexity: O(n)\n- Space complexity: O(1)\n\n# Code\n```\npublic class Solution {\n    public int MinimumMoves(string s) {\n        int moves = 0;\n        for (int i = 0; i < s.Length; i++) {\n            if (s[i] != \'O\') { \n                moves++;\n                i += 2;\n            }\n        }\n        return moves;\n    }\n}\n```
['C#']