Available question text
Count the number of length-n lowercase strings whose character multiset contains at least two 'e's, one 'l' and one 't' (so they can be rearranged to contain "leet"), computed modulo 1e9+7; this reduces to a combinatorics/inclusion–exclusion problem on letter-frequency counts for n up to 1e5.
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 2930. Number of Strings Which Can Be Rearranged to Contain Substring
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source