Package g2101_2200.s2185_counting_words_with_a_given_prefix

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2185 - Counting Words With a Given Prefix\.

    Easy

    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.

    Example 1:

    Input: words = "pay","**at**tention","practice","**at**tend", pref \= "at"

    Output: 2

    Explanation: The 2 strings that contain "at" as a prefix are: "attention" and "attend".

    Example 2:

    Input: words = "leetcode","win","loops","success", pref \= "code"

    Output: 0

    Explanation: There are no strings that contain "code" as a prefix.

    Constraints:

    • 1 <= words.length <= 100

    • 1 <= words[i].length, pref.length <= 100

    • words[i] and pref consist of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer prefixCount(Array<String> words, String pref)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait