• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2501_2600.s2514_count_anagrams.readme.md Maven / Gradle / Ivy

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 ith word of `t` is a **permutation** of the ith 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** 109 + 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 <= 105
*   `s` consists of lowercase English letters and spaces `' '`.
*   There is single space between consecutive words.