Skip to main content
Back to problems
#2255
Easy Algorithms

Count prefixes of a given string

Array String
74.2% acceptance
Feb 25, 2026
604
24
You are given a string array words and a string s, where words[i] and s comprise only of lowercase English letters. Return the number of strings in words that are a prefix of s. A prefix of a string is a substring that occurs at the beginning of the string. A substring is a contiguous sequence of characters within a string.

Solution

Rust
Time O(n)
Space O(1)
LeetCode
solution.rs
impl Solution {
  pub fn count_prefixes(words: Vec<String>, s: String) -> i32 {
    words.iter().filter(|w| s.starts_with(w.as_str())).count() as i32
  }
}