Beats 100%. Efficient solution
Approach\n Describe your approach to solving the problem. \nFrom the problem, we only need to change a character to one that is not "almost equal" to its neighb
# Approach\n<!-- Describe your approach to solving the problem. -->\nFrom the problem, we only need to change a character to one that is not "almost equal" to its neighbouring characters (i.e, it\'s left and right). We only need to add 1 to our current answer and move 2 steps ahead. Why? it is assumed that anytime we change a character, we change it to one that is not close to any of its neighbours. Eg, "zzz" could be assumed as "zaz"\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n\n# Code\n```\nclass Solution:\n    def removeAlmostEqualCharacters(self, word: str) -> int:\n        ans = 0\n        \n        i = 1\n        while i < len(word):\n            if abs(ord(word[i])-ord(word[i-1])) <= 1:\n                ans += 1\n                i += 2\n            else:\n                i += 1\n                \n        return ans\n        \n```
['Greedy', 'Python3']