C++ Easy Set Solution || Best Approach || 🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string sortVowels(string s) {\n        int n = s.size();\n        vector<char> v;\n        vector<char> c;\n        unordered_set<char> st;\n        st.insert(\'a\');\n        st.insert(\'e\');\n        st.insert(\'i\');\n        st.insert(\'o\');\n        st.insert(\'u\');\n        st.insert(\'A\');\n        st.insert(\'E\');\n        st.insert(\'I\');\n        st.insert(\'O\');\n        st.insert(\'U\');\n        for(int i=0;i<n;i++)\n        {\n            if(st.find(s[i]) != st.end())\n                v.push_back(s[i]);\n            else\n                c.push_back(s[i]);\n        }\n        sort(v.begin(),v.end());\n        reverse(v.begin(),v.end());\n        string ans="";\n        for(int i=0;i<n;i++)\n        {\n            if(st.find(s[i]) != st.end())\n            {\n                ans += v[v.size()-1];\n                v.pop_back();\n            }\n            else\n                ans += s[i];\n        }\n        return ans;\n    }\n};\n```
['Ordered Set', 'C++']