O(N) time and O(1) Space ||C++||Very Easy Solution
Constant space because i only stored vowel in map\nO(N) time because map will take O(1) time because it has only 10 keys\n\nclass Solution {\npublic:\n    strin
Constant space because i only stored vowel in map\nO(N) time because map will take O(1) time because it has only 10 keys\n```\nclass Solution {\npublic:\n    string sortVowels(string s) {\n        map<char,int>mp; // for storing vowels\n        set<char>st={\'a\',\'A\',\'e\',\'E\',\'i\',\'I\',\'o\',\'O\',\'u\',\'U\'};\n        for(auto it:s)\n        {\n            if(st.count(it))mp[it]++;\n        }\n        auto it=mp.begin();\n        for(int i=0;i<s.size();i++)\n        {\n            if(!st.count(s[i]))continue;\n            if(it->second==0)it++; \n            s[i]=it->first;\n            it->second--;\n        }\n        return s;\n    }\n};\n```
[]