Minimum Moves to Convert String || Beat 100% python || 0ms
IntuitionApproachComplexity
Time complexity:O(n)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def minimumMoves(self, s: str) -> int:
        move=0
        i=0
        n=len(s)
        while i<n:
            if s[i]=="X":
                move+=1
                i+=3
            else:
                i+=1
        return move
```
['Python3']