Maximize Consecutive Equal Answers
Problem statement
A string contains only T and F. You may change at most maxChanges characters. Return the maximum length of a contiguous substring that can be made entirely equal.
Function
maximizeConfusion(answers: String, maxChanges: int) → intExamples
Example 1
answers = "TTFF"maxChanges = 2return = 4Case 1 exercises the documented deterministic contract.
Example 2
answers = "TFFT"maxChanges = 1return = 3Case 2 exercises the documented deterministic contract.
Example 3
answers = "TTFTTFTT"maxChanges = 1return = 5Case 3 exercises the documented deterministic contract.
Constraints
1 <= answers.length <= 200000.0 <= maxChanges <= answers.length.