#3713

Longest Balanced Substring I

pupil · 570 · lc medium +29 · 69.7% accepted · 415 likes · top 78%

Description

Given a lowercase string s, return the length of the longest substring in which every distinct character appears exactly the same number of times.

Code

1

2

3

class Solution:
    def longestBalanced(self, s: str) -> int:

class Solution:
    def longestBalanced(self, s: str) -> int: