Problem: Counting Words With a Given Prefix

Description:

You are given:

• An array of strings words.
• A string pref.

Your task is to count how many strings in words start with the prefix pref.

A prefix of a string s is defined as any leading contiguous substring of s. For example:

• "pre" is a prefix of "prefix".
• "ex" is a prefix of "example".

Return the count of strings in words that have pref as their prefix.

---

Examples:

Example 1:

Input:
words = ["apple", "apply", "application", "banana"]
pref = "app"

Output:
3

Explanation:
The strings that start with the prefix "app" are:

• "apple"
• "apply"
• "application"

So, the result is 3.

---

Example 2:

Input:
words = ["cat", "car", "dog", "cart"]
pref = "ca"

Output:
3

Explanation:
The strings that start with the prefix "ca" are:

• "cat"
• "car"
• "cart"

So, the result is 3.

---

Example 3:

Input:
words = ["hello", "world", "hi", "house"]
pref = "ho"

Output:
1

Explanation:
The only string that starts with the prefix "ho" is:

• "house"

So, the result is 1.

---

Constraints:

1. $1 \leq \text{words.length} \leq 100$
2. $1 \leq \text{words[i].length}, \text{pref.length} \leq 100$
3. All strings in $\text{words}$ and $\text{pref}$ consist of lowercase English letters.

---

Goal:

Write a function that takes the array words and the string pref as input and returns the count of strings in words that start with the prefix pref.