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