Simple java solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int removeAlmostEqualCharacters(String word) {\n        int count=0;\n        for(int i=0;i<word.length()-1;)\n        {\n            char c=word.charAt(i);\n            char d=word.charAt(i+1);\n            if(c==d || (c+1)==d || (c-1)==d)\n            {\n                count++;\n                i+=2;\n            }\n            else\n            {\n                i++;\n            }\n        }\n        return count;\n    }\n}\n```
['Java']