You are given a string s that is formed by concatenating one or more anagrams of an unknown string t.

Return the minimum possible length of the string t.

An anagram of a string is a string formed by rearranging the letters of the original string, using all original letters exactly once.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists only of lowercase English letters.

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.