Easy C++ 👀 & Python Solution 🐍
C++\n\nclass Solution {\npublic:\n    string shortestBeautifulSubstring(string s, int k) {\n        int c=0;\n        string ans="";\n        vector<string>vect
# C++\n```\nclass Solution {\npublic:\n    string shortestBeautifulSubstring(string s, int k) {\n        int c=0;\n        string ans="";\n        vector<string>vect;\n        int m=101;\n        \n        for(int i=0;i<s.size();i++){\n            ans="";\n            c=0;\n            for(int j=i;j<s.size();j++){\n                ans+=s[j];\n                if(s[j]==\'1\'){\n                    c++;\n                }\n                if(c>=k){\n                    m=min(m,j-i+1);\n                    vect.push_back(ans);\n                }\n            }\n        }\n        \n        sort(vect.begin(),vect.end());\n        for(auto ele:vect){\n            if(ele.size()==m){\n                return ele;\n            }\n        }\n        return "";\n    }\n};\n\n```\n# Python\n```\nclass Solution:\n    def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n        Min=101\n        ans=[]\n        for i in range(len(s)):\n            for j in range(i,len(s)+1):\n                if s[i:j].count(\'1\')==k:\n                    ans.append(s[i:j])\n                    if Min>len(s[i:j]): Min=len(s[i:j])\n        ans.sort()\n        for i in ans:\n            if len(i)==Min: return i\n        return \'\'\n```\n***Hope it helps...!!*** \uD83D\uDE07\u270C\uFE0F
['Array', 'String', 'Python', 'C++', 'Python3']