🚀🚩 Most Easiest Solution 🚀🚩
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n1. First take out all the vowels from string s and store in temp.\n2. The
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n1. First take out all the vowels from string s and store in temp.\n2. Then sort the temp string.\n3. Now again traverse on original string and insert the vowels according to the sorted temp string. \n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(N*logN)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool isVowel(char ch)\n    {\n        ch = tolower(ch);\n        if(ch == \'a\' or ch == \'e\' or ch == \'i\' or ch == \'o\' or ch == \'u\') return true;\n        return false;\n    }\n    string sortVowels(string s) {\n        ios_base::sync_with_stdio(false);\n        cin.tie(0);\n        cout.tie(0);\n        \n        string temp;\n        for(auto x : s)\n        {\n            if(isVowel(x)) \n                temp.push_back(x);\n        }\n        sort(temp.begin(),temp.end());\n\n        int j = 0;\n        for(int i = 0; i < s.length(); i++)\n        {\n            if(isVowel(s[i]))\n            {\n                s[i] = temp[j++];\n            }\n        }\n        return s;\n    }\n};\n```
['String', 'C', 'Sorting', 'Python', 'C++', 'Java', 'JavaScript']