Super fast simple solution |  Greedy
Intuition\njust updated with next possible valid char and counted such index which does not satisfy the condtiton \n# Code\n\nclass Solution {\npublic:\n    int
# Intuition\njust updated with next possible valid char and counted such index which does not satisfy the condtiton \n# Code\n```\nclass Solution {\npublic:\n    int removeAlmostEqualCharacters(string word) {\n        int cnt = 0 ;\n        for(int i = 1 ; i< word.size(); i++){\n            if(abs(word[i]-word[i-1]) <=1){\n                cnt++;\n                word[i]=(word[i]-\'a\'+2);\n            }\n        }\n        return cnt ; \n    }\n};\n\n        \n\n\n```
['C++']