Given a simple encryption method using the frequency, decrypt n strings.
To solve this problem, the key is to get the mapping. That is:
- Get the frequency of each character
in the input string (bins are used
- Sort them in order;
- Find the mapping;
- Decrypt it.
The time complexity is O(L), where L is the total length of the input strings.
AUTHOR’S AND TESTER’S SOLUTIONS:
Solutions to be uploaded soon
Author’s solution can be found here.
Tester’s solution can be found here.