Find smallest substring to make string steady
Filed under EduThrill
The question
Given a string with alphabet set {B, D, U, H} considered steady if each letter occurs n/4 times, find the length of the smallest possible substring to be replaced to achieve the outcome.
No write-up yet. Related questions below have one.
Related EduThrill questions
Collected from public candidate posts and coding forums. Updated Nov 2026.