Count Prefixes of a Given String

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.

LeetCode Problem - 2255

class Solution {
    public int countPrefixes(String[] words, String s) {
        int count = 0; // Initialize a counter to keep track of matching prefixes

        // Iterate through each string in the 'words' array
        for (String str : words) {
            // Check if the string 's' starts with the current string 'str'
            if (s.startsWith(str)) {
                count++; // Increment the counter if 'str' is a prefix of 's'
            }
        }

        return count; // Return the total count of prefixes
    }
}