Problem Statement

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.

Examples

Example 1:

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.

Example 2:

Input: words = ["abc","bcd","aaaa","cbc"], x = "a"
Output: [0,2]
Explanation: "a" occurs in "abc", and "aaaa". 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 <= words.length <= 50
• 1 <= words[i].length <= 50
• x is a lowercase English letter.
• words[i] consists only of lowercase English letters.

Approaches

1️⃣ Nested Loop

Code:

vector<int> findWordsContaining(vector<string>& words, char x) {
        vector<int> arr;
        // Loop to iterate the word.
        for(int i = 0; i < words.size(); i++){
            string word = words[i];
            // loop to iterate the character of the word.
            for(int j = 0; j < word.size(); j++){
                if(word[j] == x){
                    arr.push_back(i);
                    break;
                }
            }
        }
        return arr;
    }

Complexity Analysis:

• Time Complexity: O(n*m), where n is the number of words, and m is the average length of words in the array.
• Space Complexity: O(n)