<p>You are given a string <code>s</code> containing one or more words. Every consecutive pair of words is separated by a single space <code>&#39; &#39;</code>.</p>

<p>A string <code>t</code> is an <strong>anagram</strong> of string <code>s</code> if the <code>i<sup>th</sup></code> word of <code>t</code> is a <strong>permutation</strong> of the <code>i<sup>th</sup></code> word of <code>s</code>.</p>

<ul>
	<li>For example, <code>&quot;acb dfe&quot;</code> is an anagram of <code>&quot;abc def&quot;</code>, but <code>&quot;def cab&quot;</code>&nbsp;and <code>&quot;adc bef&quot;</code> are not.</li>
</ul>

<p>Return <em>the number of <strong>distinct anagrams</strong> of </em><code>s</code>. Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;too hot&quot;
<strong>Output:</strong> 18
<strong>Explanation:</strong> Some of the anagrams of the given string are &quot;too hot&quot;, &quot;oot hot&quot;, &quot;oto toh&quot;, &quot;too toh&quot;, and &quot;too oht&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> There is only one anagram possible for the given string.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists of lowercase English letters and spaces <code>&#39; &#39;</code>.</li>
	<li>There is single space between consecutive words.</li>
</ul>

def countAnagrams(s: str) -> int:
    from math import factorial
    from collections import Counter
    MOD = 10**9 + 7

    # Helper function to compute factorial modulo
    def factorial_mod(n):
        result = 1
        for i in range(2, n + 1):
            result = (result * i) % MOD
        return result

    # Helper function to compute modular inverse using Fermat's Little Theorem
    def mod_inv(x):
        return pow(x, MOD - 2, MOD)

    # Split the string into words
    words = s.split()

    # Precompute factorials and inverses up to the maximum length of words
    max_len = max(len(word) for word in words)
    fact = [1] * (max_len + 1)
    for i in range(2, max_len + 1):
        fact[i] = (fact[i - 1] * i) % MOD

    inv_fact = [1] * (max_len + 1)
    for i in range(2, max_len + 1):
        inv_fact[i] = mod_inv(fact[i])  # Correct use of precomputed factorial for modular inverse

    # Calculate the product of permutations for all words
    total_permutations = 1
    for word in words:
        char_count = Counter(word)
        word_len = len(word)
        word_permutations = factorial_mod(word_len)  # Utilize precomputed factorial using a helper function
        for count in char_count.values():
            word_permutations = (word_permutations * inv_fact[count]) % MOD  # Apply precomputed inverse factorial
        total_permutations = (total_permutations * word_permutations) % MOD

    return total_permutations

# Example usage
print(countAnagrams("too hot"))  # Output: 18
print(countAnagrams("aa"))       # Output: 1



class Solution:
    def countAnagrams(self, *args, **kwargs):
        return countAnagrams(*args, **kwargs)


873