Find Words Containing Character — LeetCode 2942 Python Solution

The problem

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.

Example

Input

words = ["leet","code"], x = "e"

Output

[0,1]

Explanation

"e" occurs in both words: "leet", and "code". Hence, we return indices 0 and 1.

Python solution

class Solution:
    def findWordsContaining(self, words: List[str], x: str) -> List[int]:
        return [i for i, w in enumerate(words) if x in w]

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2942. Find Words Containing Character is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems