How should I practice Longest Equal-Frequency Substring?

Start by reading the full statement, solve the visible examples, then compare the pattern against related DRW phone screen problems in FastPrep.

Is Longest Equal-Frequency Substring associated with DRW?

FastPrep tags this as a DRW phone screen coding practice problem when the problem catalog has that company and stage context.

DRW● MediumINTERNPHONE SCREEN

You are given a lowercase English string s. A substring is balanced when every distinct letter that appears in it has the same frequency.

Return the maximum length of a balanced substring.

longestBalancedSubstring(s: String) → int

s = "abbac"return = 4

The substring abba contains two as and two bs.

s = "aaaa"return = 4

A substring containing only one distinct letter is balanced.

s = "abcabc"return = 6

Each of a, b, and c occurs twice.