Similar to minimum window substring
https://leetcode.com/problems/minimum-window-substring/

Solved the question within the given time, ran it as well. Just needed a hint to reduce time from O(n * t) to O(n), Implemented that as well.

Not sure why I got rejected, maybe I took extra time or they expected 2 questions to be solved in the span of an hour.