GoLang Solution For LeetCode Problem: Sort Characters By Frequency
Solving Sort Characters By Frequency in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a string, sort it in decreasing order based on the frequency of characters.
Input: "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.
Input: "cccaaa" Output: "cccaaa" Explanation: Both 'c' and 'a' appear three times, so "aaaccc" is also a valid answer. Note that "cacaca" is incorrect, as the same characters must be together.
Input: "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.
See the full details of the problem Sort Characters By Frequency at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go