Leetcode 2930. Number of Strings Which Can Be Rearranged to Contain Substring

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2930. Number of Strings Which Can Be Rearranged to Contain Substring

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact