Leetcode 395. Longest Substring with At Least K Repeating Characters

Find the length of the longest substring of a lowercase string s such that every character in that substring appears at least k times. The core challenge is to efficiently locate maximal contiguous segments that meet the per-character frequency constraint (often leveraging the fact the alphabet is only 26 letters).