Leetcode 2213. Longest Substring of One Repeating Character

Given a string, perform k single-character updates and after each update return the length of the longest substring made of a single repeated character; with n,k up to 1e5 this requires an efficient dynamic structure (e.g., a segment tree that merges prefix/suffix run lengths and max run) to update and query in O(log n) time.