Easiest Solution Ever
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
![49h9ra.jpg](https://assets.leetcode.com/users/images/4f07eb51-0024-4292-9ccb-38b04652ade2_1742790621.845352.jpeg)
<!-- Describe your first thoughts on how to solve this problem. -->

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

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

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

# Code
```java []
class Solution {
    public int minimumMoves(String s) {
        int i = 0; 
        int step = 0;
        while(i<s.length()){
            if(s.charAt(i)=='X'){
                i = i+3;
                step++;
            }
            else{
                i++;
            }
        }
        return step;
       
        
    }
}
```
['Java']