Fastest Solution (100% Beats), Kadane's Approach - Java
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{\n    public int maxPower(String s){\n        int ans = 0;\n        int k = 0;\n        for(int i=0; i<s.length()-1; i++){\n            if(s.charAt(i)==s.charAt(i+1)) k++;\n            else k=0;\n            ans = Math.max(ans, k);\n        }\n        return Math.max(ans, k)+1;\n    }\n}\n```
['Java']