3713. Longest Balanced Substring I

You are given a string s consisting of lowercase English letters. A substring of s is called balanced if all distinct characters in the substring appear the same number of times. Return the length of the longest balanced substring of s. Example 1: Input: s = "abbac" Output: 4 Explanation: The longest balanced substring is "abba" because both distinct characters 'a' and 'b' each appear exa