UST GET OA 2025 | Health-Tech Signal Packet Validation | Longest Repeating Character Replacement

Problem - Health-Tech Signal Packet Validation Problem Statement You are given a string statusStream consisting of uppercase English letters and an integer K. You may replace at most K characters with any uppercase letter. Return the length of the longest contiguous substring that can be transformed into a string containing only one distinct character. Constraints Constraint 1 ≤ N ≤ 50,000 0 ≤ K ≤ N statusStream contains only uppercase English letters. Example Input Output statusStream = "AABABBA" K = ...