C++ 😊 ADITYA VERMA SOLUTION 💖
\nclass Solution\n{\npublic:\n    string minWindow(string s, string t)\n    {\n        unordered_map<char, int> mp;\n        for (int i = 0; i < t.size(); i++)\
```\nclass Solution\n{\npublic:\n    string minWindow(string s, string t)\n    {\n        unordered_map<char, int> mp;\n        for (int i = 0; i < t.size(); i++)\n        {\n            mp[t[i]]++;\n        }\n        int count = mp.size();\n        string ans;\n\n        int mini = INT_MAX;\n\n        int i = 0;\n        int j = 0;\n\n        while (j < s.size())\n        {\n\n            if (mp.find(s[j]) != mp.end())\n            {\n                mp[s[j]]--;\n                if (mp[s[j]] == 0)\n                {\n                    count--;\n                }\n            }\n\n            while (count == 0)\n            {\n                if (mini > j - i + 1)\n                {\n                    mini = min(mini, j - i + 1);\n                    ans = s.substr(i, j - i + 1);\n                }\n                if (mp.find(s[i]) != mp.end())\n                {\n                    mp[s[i]]++;\n                    if (mp[s[i]] == 1)\n                    {\n                        count++;\n                    }\n                }\n                i++;\n            }\n            j++;\n        }\n        return ans;\n    }\n};\n\t```
['C']