c++ Write a function called MinWindowSubstring(Text subText) that takes a struct object of type Text as shown below and has two elemnts: the first element Sentence which is a long sentence or string, and the second element sub is a string contains some characters. Your goal is to determine the smallest substring of Sentence that contains all the characters in sub. For example: if subText is Senetnce="aaabaaddae", sub="aed" then the smallest substring of Sentence that contains the characters a, e, and d is "dae" located at the end of the string. So for this example your program should return the string dae. Your program must contain and use the following: A struct called Text that will be used to store each position. struct Text { string Sentence; string sub; }; A function called MinWindowSubstring that will calculate and return the minimum substring of a senetence, which will be called by your main function. string MinWindowSubstring(Text subText); Input: The first line of the input contains a positive integer t, which indicates the number of testcases the program will have to run. The first line is followed by t lines, each containing a separate testcase. Each testcase ti consists of two strings separated by a white space, they are the elements of the struct object. The values will always be such that length of sentence > length of sub . Output: The output must contain t lines, where each line has a single string which is the output of the calculation of the testcase ti. Sample Input Sample Output 2 Aaabaaddae aed aabdccdbcacd aad dae aabd
c++
Write a function called MinWindowSubstring(Text subText) that takes a struct object of type Text as shown below and has two elemnts: the first element Sentence which is a long sentence or string, and the second element sub is a string contains some characters. Your goal is to determine the smallest substring of Sentence that contains all the characters in sub.
For example: if subText is Senetnce="aaabaaddae", sub="aed" then the smallest substring of Sentence that contains the characters a, e, and d is "dae" located at the end of the string. So for this example your program should return the string dae.
Your program must contain and use the following:
- A struct called Text that will be used to store each position.
struct Text {
string Sentence;
string sub;
};
- A function called MinWindowSubstring that will calculate and return the minimum substring of a senetence, which will be called by your main function.
string MinWindowSubstring(Text subText);
Input:
The first line of the input contains a positive integer t, which indicates the number of testcases the program will have to run. The first line is followed by t lines, each containing a separate testcase. Each testcase ti consists of two strings separated by a white space, they are the elements of the struct object. The values will always be such that length of sentence > length of sub .
Output:
The output must contain t lines, where each line has a single string which is the output of the calculation of the testcase ti.
|
Sample Input |
Sample Output |
|
2 Aaabaaddae aed aabdccdbcacd aad |
dae aabd |
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
