SUPER EASY SOLUTION
Intuition\n Describe your first thoughts on how to solve this problem. \nhttps://www.youtube.com/watch?v=_t8kq_RpiPU\n\n# Code\n\nclass Solution {\npublic:\n   
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nhttps://www.youtube.com/watch?v=_t8kq_RpiPU\n\n# Code\n```\nclass Solution {\npublic:\n    string minWindow(string s, string t) {\n        unordered_map<char,int> hast_s;\n        unordered_map<char,int> hast_t;\n        if(s.length()<t.length()) return "";\n\n        for(int i=0;i<t.length();i++){\n            hast_t[t[i]]++;\n        }\n        \n         int count=0, start=0,start_ind=-1,min_length=INT_MAX;\n        for(int i=0;i<s.length();i++){\n            hast_s[s[i]]++;\n            if(hast_s[s[i]] <= hast_t[s[i]])count++;\n\n            if(count==t.length()){\n                while(hast_s[s[start]]>hast_t[s[start]]){\n                    hast_s[s[start]]--;\n                    start++;  \n                }\n                if(min_length>i-start+1){\n                   min_length= i-start+1;\n                   start_ind=start;\n                }\n            }\n        }\n        if(start_ind == -1)return "";\n        else return s.substr(start_ind , min_length);\n    }\n};\n```
['Hash Table', 'Sliding Window', 'C++']