EASY GREEDY SOLUTION
Complexity\n- Time complexity: O(n)\n\n- Space complexity: O(1)\n\n# Code\n\nclass Solution {\npublic:\n    int removeAlmostEqualCharacters(string word) {\n    
# Complexity\n- Time complexity: $$O(n)$$\n\n- Space complexity: $$O(1)$$\n\n# Code\n```\nclass Solution {\npublic:\n    int removeAlmostEqualCharacters(string word) {\n        int ans = 0;\n        for(int i = 1;i<word.length();i++){\n            \n            if(word[i]>=word[i-1] && word[i]-word[i-1]<=1)\n            {\n                ans++;\n                i++;\n            }\n            else if(word[i]<word[i-1] && word[i-1]-word[i]<=1){\n                ans++;\n                i++;\n            }\n        }\n        return ans;\n    }\n};\n```
['Greedy', 'C++']