Simple Greedy 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: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int removeAlmostEqualCharacters(string word) {\n        int n = word.size();\n        int count = 0;\n        for(int i = 1; i < n; i++){\n            if(word[i-1] == word[i] || word[i-1] + 1 == word[i] || word[i-1] == word[i] + 1){\n                i++;\n                count++;\n            }\n        }\n        return count;\n    }\n};\n```
['C++']