Available question text
Compute how many distinct strings you can get by independently permuting the letters of each word (words' order fixed); this equals the product over words of multinomial coefficients len! / ∏freq(letter)!, taken modulo 10^9+7. The challenge is efficient combinatorics under the 10^5 total length constraint (large factorials and modular arithmetic).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2514. Count Anagrams
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source