easy hai ek loop mein ho jayega kar do jaldi solve :D
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```cpp []\nclass Solution {\npublic:\n    int maxPower(string s) {\n        int c=0;\n        int max=0;\n        for(int i=0;i<s.length()-1;i++)\n        {\n            if(s[i]==s[i+1])\n               c++;\n            else\n               c=0;\n\n            if(c>max)\n              max=c;\n        }\n        return max+1;\n    }\n};\n```
['C++']