[Python3] O(N)
\tclass Solution:\n\t\tdef minimumMoves(self, s: str) -> int:\n\t\t\tcount=i=0\n\t\t\twhile i<len(s):\n\t\t\t\tif s[i]=="X":\n\t\t\t\t\tcount+=1\n\t\t\t\t\ti+=3
\tclass Solution:\n\t\tdef minimumMoves(self, s: str) -> int:\n\t\t\tcount=i=0\n\t\t\twhile i<len(s):\n\t\t\t\tif s[i]=="X":\n\t\t\t\t\tcount+=1\n\t\t\t\t\ti+=3\n\t\t\t\telse:\n\t\t\t\t\ti+=1\n\t\t\treturn count
[]