Check Word Presence in String

Given a string S and a list wordList containing N distinct words, determine if each word in wordList is present in S. Return a boolean array where the value at index 'i' indicates the presence of Wi in S.

Input:

The first line contains an integer ‘T’, the number of test cases.
The following 3*T lines represent the test cases:
The first line of each test case provides the string ‘S’.
The second line provides an integer ‘N’, the number of words in ‘wordList’.
The third line provides ‘N’ space-separated strings indicating the words in ‘wordList’.

Output:

For each test case, output a boolean array indicating if each word in ‘wordList’ is present in ‘S’.

Example:

Input:
2
hello world
3
hello world Code
Programming is fun
2
fun Code

Output:
[True, True, False]
[True, False]

Constraints:

1

Question

Check Word Presence in String

Given a string S and a list wordList containing N distinct words, determine if each word in wordList is present in S. Return a boolean array where the value at index 'i' indicates the presence of Wi in S.

Input:

The first line contains an integer ‘T’, the number of test cases.
The following 3*T lines represent the test cases:
The first line of each test case provides the string ‘S’.
The second line provides an integer ‘N’, the number of words in ‘wordList’.
The third line provides ‘N’ space-separated strings indicating the words in ‘wordList’.

Output:

For each test case, output a boolean array indicating if each word in ‘wordList’ is present in ‘S’.

Example:

Input:
2
hello world
3
hello world Code
Programming is fun
2
fun Code

Output:
[True, True, False]
[True, False]

Constraints:

1 <= T <= 50
1 <= |S| <= 10^3
1 <= N <= 10^3
1 <= |W| <= 10

Note:

String 'S' includes lowercase, uppercase alphabets, and spaces.
String ‘Wi’ consists of lowercase and uppercase alphabets only.
The presence of ‘Wi’ is case sensitive.
Do not use built-in string-matching methods.
Return the boolean array without printing it.

Accepted Answer

Check If Given Words Are Present In A String
Given a string 'S' and a list 'wordList' that consists of 'N' distinct words. Let 'Wi' denote word at index 'i' in 'wordList'. For each word 'Wi' in 'wordList', you need to determine whether it is present in string 'S' or not. Return a boolean array, where a boolean value at index ‘i’ represents whether the word ‘Wi’ is present in the string ‘S’ or not.
Input Format :
The first line of input contains an integer ‘T’ denoting the number of test cases. The next ‘3*T’ lines represent the ‘T’ test cases. The first line of each test case contains the string ‘S’. The second line of each test contains an integer ‘N’ representing the number of words in the ‘wordList’. The third line of each test case contains the ‘N’ space-separated strings representing the words in the ‘wordList’.
Output Format :
For each test case, print a boolean array where the value at index ‘i’ is ‘True’ if the word at index ‘i’ in the ‘wordList’ is present in string ‘S’ Otherwise, it is ‘False’.
Note :
1. String ‘S’ consists of lowercase, uppercase alphabets, and spaces. 2. String ‘Wi’ consists of lowercase and uppercase alphabets only. 3. The word, ‘Wi’ is case sensitive. 4. You can’t use language-built-in string-matching methods. 5. Don’t print anything, just return the boolean array determining the presence or absence of the words present in ‘wordList’.
Constraints :
1 <= T <= 50 1 <= |S| <= 10^3 1 <= N <= 10^3 1 <= |W| <= 10 Where ‘|S|’ denotes the length of string and |W| denotes the maximum length of the word present in ‘wordList’. Time limit: 1 sec

Accepted Answer

Check If Given Words Are Present In A String
Given a string 'S' and a list 'wordList' that consists of 'N' distinct words. Let 'Wi' denote word at index 'i' in 'wordList'. For each word 'Wi' in 'wordList', you need to determine whether it is present in string 'S' or not. Return a boolean array, where a boolean value at index ‘i’ represents whether the word ‘Wi’ is present in the string ‘S’ or not.
Input Format :
The first line of input contains an integer ‘T’ denoting the number of test cases. The next ‘3*T’ lines represent the ‘T’ test cases. The first line of each test case contains the string ‘S’. The second line of each test contains an integer ‘N’ representing the number of words in the ‘wordList’. The third line of each test case contains the ‘N’ space-separated strings representing the words in the ‘wordList’.
Output Format :
For each test case, print a boolean array where the value at index ‘i’ is ‘True’ if the word at index ‘i’ in the ‘wordList’ is present in string ‘S’ Otherwise, it is ‘False’.
Note :
1. String ‘S’ consists of lowercase, uppercase alphabets, and spaces. 2. String ‘Wi’ consists of lowercase and uppercase alphabets only. 3. The word, ‘Wi’ is case sensitive. 4. You can’t use language-built-in string-matching methods. 5. Don’t print anything, just return the boolean array determining the presence or absence of the words present in ‘wordList’.
Constraints :
1 <= T <= 50 1 <= |S| <= 10^3 1 <= N <= 10^3 1 <= |W| <= 10 Where ‘|S|’ denotes the length of string and |W| denotes the maximum length of the word present in ‘wordList’. Time limit: