Python easy
\nclass Solution:\n    def minimumMoves(self, s: str) -> int:\n        res = 0\n        i = 0\n        while i < len(s):\n            #if current is X then jump
```\nclass Solution:\n    def minimumMoves(self, s: str) -> int:\n        res = 0\n        i = 0\n        while i < len(s):\n            #if current is X then jump 3 positions and count by 1\n            if s[i] == \'X\':\n                res += 1\n                i += 3\n            else:\n                i += 1\n        return res\n```
['Python', 'Python3']