Simple Python O(1) code with explanation
Max is simple, just calculate the num of vacuum spots between the head - min(a,b,c) and tail -  max(a,b,c)\nMin is max 2, since you can always move the head and
Max is simple, just calculate the num of vacuum spots between the head - min(a,b,c) and tail -  max(a,b,c)\nMin is max 2, since you can always move the head and tail to the neigbors of mid, with 2 exceptions:\n\t a, there is only 1 vacuum btw either of the 2 numbers, then you just need to move the third number 1 step to the vacuum. for example, 1,3,8, then min is 1\n\t b, abc is origially connective. min is 0\n \n```\n       def numMovesStones(self, a, b, c):\n        maxi = max(a,b,c) - min(a,b,c) - 2\n        mini = max((min(abs(a-b),abs(b-c),abs(a-c), 3) - 1), 1)\n        if maxi == 0: mini = 0            \n        return [mini,maxi]
[]