Pattern Search in Strings

Given two strings S and P consisting of lowercase English alphabets, determine if P is present in S as a substring.

Input:

The first line contains an integer T, the number of test cases. Each test case consists of a single line with two space-separated strings P and S.

Output:

For each test case, output "YES" if P is a substring of S, otherwise output "NO".

Example:

Input:

3 abc abcdef xyz abcdef def abcdef

Output:

YES NO YES

Constraints:

1

Question

Given two strings S and P consisting of lowercase English alphabets, determine if P is present in S as a substring.

The first line contains an integer T, the number of test cases.
Each test case consists of a single line with two space-separated strings P and S.

For each test case, output "YES" if P is a substring of S, otherwise output "NO".

3
abc abcdef
xyz abcdef
def abcdef

YES
NO
YES

You are not required to print anything; the output is managed by the system. Implement the function to return the correct result.

Accepted Answer

The task is to determine if a given substring is present in a given string.

Iterate through the string S and check if each substring of length equal to the length of P matches P.
Use string comparison to check for equality between substrings.
Return 'YES' if a match is found, otherwise return 'NO'.

Top Cisco Consultant Engineer interview questions & answers