Sort Characters by Frequency | LeetCode 451 | C++, Java, Python | May LeetCoding Day 22

**** Best Books For Data Structures & Algorithms for Interviews:**********
*****************************************************************************

May LeetCoding Challenge | Problem 22 | Sort Characters by Frequency | 22 May,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Sort Characters by Frequency,
Sort Characters by Frequency c++,
Sort Characters by Frequency Java,
Sort Characters by Frequency python,
Sort Characters by Frequency solution,

#Facebook #CodingInterview #LeetCode #MayLeetCodingChallenge #Google #Amazon #SortByFrequency

[vaibhavmalik]

We can use maxHeap of pair<int, chat> by first computing freq of each elem in freq [26] array and then putting each pair in maxHeap.

[anuragsandhu]

Concept Used: All numeric keys in object in javascript are sorted in ascending order | O(n) time complexity | O(26) space complexity

var frequencySort = function (s) {
const obj = {};
for (let index = 0; index < s.length; index++) {
if (!obj[s[index]]) {
obj[s[index]] = 1;
} else {
obj[s[index]] += 1;
}
}
const convertedObj = {};
for (const key in obj) {
if (convertedObj[obj[key]]) {
convertedObj[obj[key]][key] = key.repeat(obj[key]);
} else {
convertedObj[obj[key]] = { [key]: key.repeat(obj[key]) };
}
}
const keys = Object.keys(convertedObj);
let str = '';
for (let index = keys.length - 1; index >= 0; index--) {
for (const key in convertedObj[keys[index]]) {
str +=
}
}
return str;
};

[rishidhawan]

string frequencySort(string s) {
int freq[256]= {0};
string res;
priority_queue<pair<int, char>> maxHeap;
for (int i=0; i<s.length(); i++) {
freq[s[i]]++;
}
for (int i=0; i<256; i++) {
if (freq[i]) {
char c = (char) i;
maxHeap.push({freq[i], c});
}
}
while (!maxHeap.empty()){
pair<int, char> top = maxHeap.top();
maxHeap.pop();
for (int i=0; i<top.first; i++) {
res += top.second;
}
}
return res;
}

[aiyanshahid]

why am i getting tle when my and your code is same

[Star_Bawa]

I have not understood the Collections . sort part