Today I have done leetcode's December LeetCoding Challenge with cpp.

December LeetCoding Challenge 3

Description

Sort Characters By Frequency

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

Return the sorted string. If there are multiple answers, return any of them.

Example 1:

Input: s = "tree"
Output: "eert"
Explanation: 'e' appears twice while 'r' and 't' both appear once.
So 'e' must appear before both 'r' and 't'. Therefore "eetr" is also a valid answer.

Example 2:

Input: s = "cccaaa"
Output: "aaaccc"
Explanation: Both 'c' and 'a' appear three times, so both "cccaaa" and "aaaccc" are valid answers.
Note that "cacaca" is incorrect, as the same characters must be together.

Example 3:

Input: s = "Aabb"
Output: "bbAa"
Explanation: "bbaA" is also a valid answer, but "Aabb" is incorrect.
Note that 'A' and 'a' are treated as two different characters.

Constraints:

• 1 <= s.length <= 5 * 105
• s consists of uppercase and lowercase English letters and digits.

Solution

auto speedup = [](){
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  return 0;
}();
class Solution {
  int count[128] = {};
public:
  string frequencySort(string s) {
    for(auto c : s) {
      count[c] += 1;
    }
    sort(s.begin(), s.end(), [&](char a, char b) {
      return count[a] > count[b] || (count[a] == count[b] && a > b);
    });
    return s;
  }
};

// Accepted
// 33/33 cases passed (61 ms)
// Your runtime beats 8.74 % of cpp submissions
// Your memory usage beats 95.21 % of cpp submissions (8 MB)