# Maximize The Confusion Of An Exam: Study Guide
Maximize The Confusion Of An Exam shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A string of T/F; you may change at most k answers. Maximize the longest run of identical answers. This is a sliding window that allows at most k of the minority character: compute the longest window with at most k F's (all-T) and the longest with at most k T's (all-F), and take the max.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Allowing k changes of both kinds in one window, or requiring the window to already be uniform before counting changes.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at best AI tool for coding tests and OAs.