Search
⌘K
Leetcode 2255. Count Prefixes of a Given String
Count how many strings in the given array words are prefixes of s (i.e., equal to the starting substring of s); duplicate entries in words are counted separately. Constraints are small (words.length ≤ 1000, word and s lengths ≤ 10).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.