Given two strings s and t, find a minimum substring in s which contains all characters in t

For example, given two strings aaaaaaaaaaaabbbbbcdd and abcdd, expected output is abbbbbcdd

Window sliding approach

Iterating over s window by window with two index pointers i and j to find the minimum substring