Given 2 strings A and B, print all the interleavings of the 2 strings. An interleaved string of given two strings preserves the order of characters in individual strings and uses all the characters of both the strings. For simplicity, you can assume that the strings have unique characters.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each containing 2 space-separated strings A and B.Output FormatFor each test case, print the test case number, followed by the interleavings of the 2 strings in a sorted order, separated by a new line.Constraints1 <= T <= 100'a' <= A[i], B[i] <= 'z'1 <= len(A), len(B) <= 10ExampleInput2nkb glbn zhOutputCase #1:glnkbgnkblgnklbgnlkbngkblngklbnglkbnkbglnkgblnkglbCase #2:bnzhbzhnbznhzbhnzbnhzhbn

Given a string without duplicates, print all the permutations of the string in a lexicographically order.Input FormatFirst line of input contains T - number of test cases. Its followed by T lines, each contains a single string consisting only of lowercase Enghish alphabets.ConstraintsFor each test case, print the test case number as shown, followed by all the permutations of the string in a lexicographically order, separated by newline.Output Format1 <= T <= 1001 <= len(str) <= 8Sample Input 02algodsSample Output 0Test Case #1:agloagolalgoalogaoglaolggalogaolglaogloagoalgolalagolaoglgaolgoaloaglogaoagloalgogaloglaolagolgaTest Case #2:dssd

Given 2 strings A and B, find the smallest substring of B having all the characters of A, in any order.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each line containing 2 space-separated strings - A and B.Output FormatFor each test case, print the length of the smallest substring of B having all the characters of A, separated by newline. If no such substring is found, print -1.Constraints20 points1 <= T <= 1001 <= size(A), size(B) <= 10060 points1 <= T <= 1001 <= size(A), size(B) <= 1000120 points1 <= T <= 1001 <= size(A), size(B) <= 10000General Constraints'a' <= A[i], B[i] <= 'z'ExampleInput4fkqyu frqkzkruqmfqyuzlkygonmwvytbytn uqhmfjaqtgngcwkuzyamnerphfmwbloets lwbcrsfothplxseplrtbshbtstjloxsfdzpd dclzztpjldkndgbdqqzmbpOutput7-1139ExplanationTest Case 1:The smallest substring containing all characters of A is "fqyuzlk", which has a length of 7.Test Case 2:Despite considering all possible substrings of B, we cannot find any substring containing all characters of A.Test Case 3:The smallest substring containing all characters of A is "bcrsfothplxse", which has a length of 13.Test Case 4:The smallest substring containing all characters of A is "ztpjldknd", which has a length of 9.

Write a program to print each character of a string in incremental order.Write a program to print each character of a string in incremental order as shown in the sample test cases.Sample Test CasesTest Case 1:Expected Output:str:·Keyincremental·order:·KKeKeyTest Case 2:Expected Output:str:·Pythonincremental·order:·PPyPytPythPythoPython

Given two strings, find the first occurrence of all characters of second string in the first string andprint the characters between the least and the highest index

program must accept two string values S1 (may contain space) and S2 (one word) as the input. The words in S1 are sorted lexicographically and separated by exactly one space. The program must insert the the string S2 in S1 such that all the words in the modified S1 are also in sorted order.Note: The string values contain only lower case alphabetsBoundary Condition(s):1 <= Length of S1 <= 10001 <= Length of S2 <= 100Input Format:The first line contains S1.The second line contains S2.Output Format:The first line contains the modified S1.Example Input/Output 1:Input:abacus ball dog hat mind zebrainkOutput:abacus ball dog hat ink mind zebraExample Input/Output 2:Input:captain celbrate cricketcrackerOutput:captain celbrate cracker cricket