Solution (leetcode-in-java 1.24 API)

java.lang.Object
- g2501_2600.s2514_count_anagrams.Solution

```
public class Solution
extends Object
```
2514 - Count Anagrams.
Hard

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 i^th word of t is a permutation of the i^th word of s.
- For example, "acb dfe" is an anagram of "abc def", but "def cab" and "adc bef" are not.
Return the number of distinct anagrams of s. Since the answer may be very large, return it modulo 10⁹ + 7.

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 <= 10⁵
- s consists of lowercase English letters and spaces ' '.
- There is single space between consecutive words.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int countAnagrams(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

countAnagrams

public int countAnagrams(String s)