Easy JAVA solution!!! 1ms Beats 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: 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```\nclass Solution {\n    public int maxPower(String s) {\n        int maxCount = 0, pointer = 0, counter = 0;\n        char currChar = s.charAt(pointer);\n\n        while (pointer < s.length()) {\n            if (s.charAt(pointer) == currChar) {\n                ++counter;\n                maxCount = Math.max(counter, maxCount);\n            } else {\n                counter = 1;\n                currChar = s.charAt(pointer);\n            }\n            ++pointer;\n        }\n        return maxCount;\n    }\n}\n```
['Java']