You are given a string s containing one or more words. Every consecutive pair of words is separated by a single space ' '.
A string t is an anagram of string s if the ith word of t is a permutation of the ith word of s.
Return the number of distinct anagrams of s. Since the answer may be very large, return it modulo 109 + 7.
Examples
Example 1
Input: s = "too hot"
Output: 18
Explanation: Some of the anagrams of the given string are "too hot", "oot hot", "oto toh", "too toh", and "too oht".
Example 2
Input: s = "aa"
Output: 1
Explanation: There is only one anagram possible for the given string.
Constraints
1 <= s.length <= 105
s consists of lowercase English letters and spaces ' '.
There is single space between consecutive words.
2514. Count Anagrams
Hard
50 Points
Hash Table
Math
String
Combinatorics
Counting
You are given a string s containing one or more words. Every consecutive pair of words is separated by a single space ' '.
A string t is an anagram of string s if the ith word of t is a permutation of the ith word of s.
Return the number of distinct anagrams of s. Since the answer may be very large, return it modulo 109 + 7.
Examples
Example 1
Input: s = "too hot"
Output: 18
Explanation: Some of the anagrams of the given string are "too hot", "oot hot", "oto toh", "too toh", and "too oht".
Example 2
Input: s = "aa"
Output: 1
Explanation: There is only one anagram possible for the given string.
Constraints
1 <= s.length <= 105
s consists of lowercase English letters and spaces ' '.