Simple C++| Beat 100%
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 {\npublic:\n    int removeAlmostEqualCharacters(string word) {\n        word = \'@\' + word + \'@\';\n        vector<int> temp(word.size(), 0);\n        int res = 0;\n        for (int i = 1; i < word.size() - 1; i++) {\n            if (abs(word[i+1] - word[i]) <= 1 && temp[i-1] != 1) {\n                temp[i] = 1;\n            }  \n            else if (abs(word[i+1] - word[i]) <= 1 && temp[i-1] == 1) {\n                temp[i] = 2;\n                temp[i-1] = 0;\n            }\n        }\n        for (int i=0; i< temp.size() ; i++) {\n            if (temp[i] == 1 || temp[i] == 2) {\n                res++;\n            }\n        }\n        return res;\n    }\n};\n```
['C++']