Suffix Tree - Dictionary Queries
You are given a string S, and Q queries.Input Format
Each query consist of a string T.
You have to determine if T is a substring of S.
Input consist of A string S and an integer Q followed by Q stringsOutput Format
If T is a substring of S, print "y", else print "n"Question Video
|S| <= 10^5Sample Input
Q <= 1000
|T| <= 1000
Asked in Companies