Problem title
Difficulty
Avg time to solve

Ninja and Mathematics
Moderate
30 mins
Minimum Break
Moderate
30 mins
Boyer Moore Algorithm For Pattern Searching
Moderate
30 mins
Distinct Strings With Odd and Even Swapping Allowed
Moderate
15 mins
Split Binary String
Easy
15 mins
Find K-Th Element From Product Array.
Hard
45 mins
Maximize the sum
Moderate
15 mins
Populate Inorder Successor of all nodes of a Binary Tree
Moderate
30 mins
Ninja And Sentences
Moderate
35 mins
Kevin And His Fruits
Moderate
25 mins
2

# Ninja's Frustrating Homework

Difficulty: NINJA
Contributed By
Avg. time to solve
60 min
Success Rate
60%

Problem Statement

#### Note :

``````Follow 0 based indexing.
Print the indices in sorted order.
``````

#### Input Format :

``````The first line of input contains an integer ‘T’, which denotes the number of test cases. Then each test case follows.

The first line of each test case contains a string ‘S’ representing the string in the booklet.

The second line of each test case contains an integer N denoting the number of words in the diary.

The third line of each test case contains an array of strings of size ‘N’ representing the words in the diary.
``````

#### Output Format :

``````The output contains ‘N’ space-separated integers representing starting indices of ‘N’ number of words present in the diary.
``````

#### Note:

``````You don't need to print anything, it has already been taken care of. Just implement the given function.
``````

#### Constraints :

``````1 <= T <= 10
1 <= |S| <= 1000
1 <= N <= 30

Where |S| denotes the length of the given string ‘S’.
``````
##### Sample Input 1 :
``````2
abcab
3
a cab abca
ninjasmart
3
jas art nin
``````
##### Sample Output 1:
``````0 1 2
0 3 7
``````
##### Explanation for Sample Input 1:
``````Test Case 1 :
The given string is “abcab”. The word “a” is present in the string starting from index 0 and ending at index 0, The word “cab” has starting index 2 and ending index 4 , “abca” has starting index 0 ending index 3.

Test Case 2:
The given string is “ninjasmart”. “Jas” has starting index 3 ending index 5, “art” has starting index 8 ending index 10, “nin” has starting index 0 ending index 2.
``````
##### Sample Input 2:
``````2
ahishers
4
he she his hers
bheythis
2
hey this
``````
##### Sample Output 2:
``````1 3 4 4
1 4
``````
Console