Practice Counting Words With a Given Prefix
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an array of strings words and a string pref. Return the number of strings in words that contain pref as a prefix. A prefix of a string s is any leading contiguous substring of s.
Source: Counting Words With a Given Prefix on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
words = ["pay","attention","practice","attend"], pref = "at"
Output
2
# Example 2
Input
words = ["leetcode","win","loops","success"], pref = "code"
Output
0
Constraints
1 <= words.length <= 100
1 <= words[i].length, pref.length <= 100
words[i] and pref consist of lowercase English letters.
Related LeetCode Problems
Practice more problems similar to Counting Words With a Given Prefix.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.