Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    2942 - Find Words Containing Character.

    Easy

    You are given a 0-indexed array of strings words and a character x.

    Return an array of indices representing the words that contain the character x.

    Note that the returned array may be in any order.

    Example 1:

    Input: words = "leet","code", x = "e"

    Output: 0,1

    Explanation: "e" occurs in both words: "l**<ins>ee</ins>**t", and "cod<ins> e </ins>". Hence, we return indices 0 and 1.

    Example 2:

    Input: words = "abc","bcd","aaaa","cbc", x = "a"

    Output: 0,2

    Explanation: "a" occurs in "**<ins>a</ins>**bc", and "<ins> aaaa </ins>". Hence, we return indices 0 and 2.

    Example 3:

    Input: words = "abc","bcd","aaaa","cbc", x = "z"

    Output: []

    Explanation: "z" does not occur in any of the words. Hence, we return an empty array.

    Constraints:

    • 1 &lt;= words.length &lt;= 50

    • 1 &lt;= words[i].length &lt;= 50

    • x is a lowercase English letter.

    • words[i] consists only 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 List<Integer> findWordsContaining(Array<String> words, Character x)
      • Methods inherited from class java.lang.Object

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