# LC2930 Number of Strings Which Can Be Rearranged as Substrings
Practice note for coding interviews.
Count strings whose character multiset can cover every required pattern via frequency comparisons.
Time complexity is typically linear or n log n after compression; mention edge cases (empty input, all equal, single element) in the interview.
I used [try it free](https://www.linkjob.ai/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool.