Difficulty Level: HARD
Problem Statement:
Given two strings ‘s’ and ‘t’, return the minimum window in ‘s’ which will contain all the characters in `t`. If there is no such window in ‘s’ that covers all characters in ‘t’, return an empty string " ”.
Input:
nums = [1, 1, 1], k = 2
Output:
2 //The subarrays that sum up to 2 are [1, 1] and [1, 1]