Package g2501_2600.s2514_count_anagrams

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 <code>i<sup>th</sup></code> word of t is a permutation of the <code>i<sup>th</sup></code> 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 <code>10<sup>9</sup> + 7</code>.

    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:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • s consists of lowercase English letters and spaces ' '.

    • There is single space between consecutive words.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countAnagrams(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait