Word Presence in Sentence

Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.

Input:

The first line contains an integer 'T', the number of test cases. The first line of each test case contains the sentence 'S'. The second line of each test case contains the word 'W'.

Output:

For each test case, output "Yes" if the word 'W' is present in the sentence 'S' as a complete word; otherwise, output "No". Each output should be printed on a new line.

Example:

Input:

T = 1 S = "hello world" W = "hello"

Output:

Yes

Constraints:

1 ≤ T ≤ 50

1 ≤ |S|, |W| ≤ 10000

'S' and 'W' comprise lowercase letters only

Note: Words are separated by spaces in sentence 'S'.

Question

Word Presence in Sentence

Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.

Input:

The first line contains an integer 'T', the number of test cases.
The first line of each test case contains the sentence 'S'.
The second line of each test case contains the word 'W'.

Output:

For each test case, output "Yes" if the word 'W' is present in the sentence 'S' as a complete word; otherwise, output "No".
Each output should be printed on a new line.

Example:

Input:

T = 1
S = "hello world"
W = "hello"

Output:

Yes

Constraints:

1 ≤ T ≤ 50
1 ≤ |S|, |W| ≤ 10000
'S' and 'W' comprise lowercase letters only

Note: Words are separated by spaces in sentence 'S'.

Accepted Answer

Check if a given word is present in a sentence as a complete word, not a substring.

Split the sentence into words using spaces as delimiters.
Check if the given word matches any of the words in the sentence exactly.
Ensure the word is not part of a larger word in the sentence.
Output 'Yes' if the word is found as a complete word, 'No' otherwise.