Python Solution (Beats 100%)
\n\n# Code\npython3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        x, y, z = sorted([a, b, c])\n        # prin
\n\n# Code\n```python3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        x, y, z = sorted([a, b, c])\n        # print(x, y, z)\n        if x + 1 == y == z - 1:\n            min_step = 0\n        elif y - x > 2 and z - y > 2:\n            min_step = 2\n        else:\n            min_step = 1\n        max_step = z - x - 2\n        return [min_step, max_step]\n\n        \n```
['Python3']