Tap here to switch tabs
Problem
Submissions

Problem: Minimum Length of Anagram Concatenation

Minimum Length of Anagram Concatenation asks you to return the shortest possible length of an unknown string whose anagrams, concatenated together, form the given string.

Statement

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≤1 \leq s.length ≤105\leq 10^5

  • s consists only of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Length of Anagram Concatenation

Minimum Length of Anagram Concatenation asks you to return the shortest possible length of an unknown string whose anagrams, concatenated together, form the given string.

Statement

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≤1 \leq s.length ≤105\leq 10^5

  • s consists only of lowercase English letters.