C++ Solution
\nclass Solution {\npublic:\n    vector<int> frequencySort(vector<int>& nums) {\n        unordered_map<int, int> counter;\n        \n        for (const auto& nu
```\nclass Solution {\npublic:\n    vector<int> frequencySort(vector<int>& nums) {\n        unordered_map<int, int> counter;\n        \n        for (const auto& num : nums) counter[num]++; \n        \n        sort(nums.begin(), nums.end(), [&](int a, int b) {\n            return counter[a] < counter[b] || (counter[a] == counter[b] && b < a);\n        });\n        \n        return nums;\n    }\n};\n```
['C']