|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Your task is to implement the function strstr. The function takes two strings as arguments(s,x) and locates the occurrence of the string x in the string s. The function returns and integer denoting the first occurrence of the string x .
The first line of input contains an integer T denoting the no of test cases . Then T test cases follow. The first line of each test case contains two strings str and target.
For each test case in a new line output will be an integer denoting the first occurrence of the target string in the string s. Return -1 if no match found.
1<=length of (s,x)<=1000
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.