You are given a string compressed that represents a compressed string format where each character is followed by its frequency.

Create a better compression of the string such that:

• Each distinct character appears exactly once.

• The characters are arranged in alphabetical order.

• Each character is directly followed by the sum of all its frequencies from the original string.

Return the better compressed string.

Constraints:

• $1 \leq$ compressed.length $\leq 6 imes 10^4$

• compressed consists only of lowercase English letters and digits.

• compressed is a valid compression, where each character is followed by its frequency.

• Frequencies are in the range $[1, 10^4]$ and have no leading zeroes.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.