Challenges

Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 188
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 289
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1617
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5128
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4216
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2376
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3662
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4348
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2996
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2255
String Matching
Please select a challenge
Problem Statement
Cody has a sequence of characters N. He likes a sequence if it contains his favourite sequence as a substring. Given the sequence and his favourite sequence F, check whether the favourite sequence is present in the sequence.

Input
The first line of input contains a single line T, which represents the number of test cases. Each test case consists of 2 strings separated by space N and F respectively.

Output
Print "Yes" if the sequence contains the favorite sequence in it, otherwise print "No".

Constraints
1<=T<=10. 1<=|N|,|F|<=100. All the characters are lowercase alphabets.

Sample Input
2
abcde abc
pqrst pr

Sample Output

Yes
No

Dcoded By: Bhanu Nadar

Solved By: 2376

Maximum Marks: 3