Longest Target Run After Replacements

You are given an integer array nums, an integer target, and an integer maxChanges.

You may choose at most maxChanges elements whose value is not target and change each chosen element to target.

Return the maximum possible length of a contiguous subarray that can contain only target after performing at most maxChanges changes. If no non-empty target-only subarray can be formed, return 0.

Original Interview Report

Onsite 1 was an array problem that became harder step by step. Given an original array:

1. Given a number n, return the longest consecutive length where n appears.
2. Given a target array such as [n, m, k], return each target number's longest consecutive occurrence count in the original array.
3. Given a number n and an integer k, you may change at most k numbers into n. Return the longest consecutive length of n after the changes.

The third part felt like a sliding-window problem, but the idea was not immediately obvious at first; it was derived from the lower-level reasoning.