Simple Approach using one for loop
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumMoves(string s) {\n        int n = s.size();\n        int count = 0;\n        for (int i = 0; i < n; i++) {\n            if (s[i] == \'X\') {\n                count++;\n                i += 2;\n            }\n        }\n        return count;\n    }\n};\n\n```
['C++']