A sliding window problem similar with Longest Repeating Character Replacement while requires more intricate technique.

Description

Given two strings s and t of lengths m and n respectively, return the minimum window…