counting-words-with-a-given-prefix

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given an array of strings <code>words</code> and a string <code>pref</code>.

Return the number of strings in <code>words</code> that contain <code>pref</code> as a prefix.

A prefix of a string <code>s</code> is any leading contiguous substring of <code>s</code>.

&nbsp;
Example 1:

<pre>
Input: words = [&quot;pay&quot;,&quot;attention&quot;,&quot;practice&quot;,&quot;attend&quot;], <code>pref </code>= &quot;at&quot;
Output: 2
Explanation: The 2 strings that contain &quot;at&quot; as a prefix are: &quot;attention&quot; and &quot;attend&quot;.
</pre>

Example 2:

<pre>
Input: words = [&quot;leetcode&quot;,&quot;win&quot;,&quot;loops&quot;,&quot;success&quot;], <code>pref </code>= &quot;code&quot;
Output: 0
Explanation: There are no strings that contain &quot;code&quot; as a prefix.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length, pref.length &lt;= 100</code></li>
	<li><code>words[i]</code> and <code>pref</code> consist of lowercase English letters.</li>
</ul>