Given a string without duplicates, print all the permutations of the string in a lexicographical order.Note:Do not use any inbuilt functions / libraries for your main logic.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each containing a single string consisting only of lowercase English alphabets.Output FormatFor each test case, print the test case number as shown, followed by all the permutations of the string in a lexicographic order, separated by a new line.Constraints1 <= T <= 1001 <= len(str) <= 8ExampleInput2algodsOutputTest Case #1:agloagolalgoalogaoglaolggalogaolglaogloagoalgolalagolaoglgaolgoaloaglogaoagloalgogaloglaolagolgaTest Case #2:dssd

Given an array of unique integer elements, print all the subsets of the given array in lexicographical order.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N - the size of the array and the second line contains the elements of the array.Output FormatFor each test case, print the subsets of the given array in lexicographical order, separated by new line. Print an extra newline between output of different test cases.Constraints1 <= T <= 1001 <= N <= 100 <= A[i] <= 100ExampleInput335 15 3 257 96 43 15 8 23 Output3 3 5 3 5 15 3 15 5 5 15 15 57 57 96 96 3 3 8 3 8 15 3 8 15 23 3 8 23 3 15 3 15 23 3 23 8 8 15 8 15 23 8 23 15 15 23 23

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

Input FormatThe first and only line of input contains an integer N.Output FormatPrint the count of permutations.Constraints1 ≤ N ≤ 100ExampleInput8Output576

First line of input contains T - number of test cases. Its followed by T lines, each line contains a string of size N, containing only lowercase english alphabets.Output FormatFor each test case, print the length of the largest substring that does not contain any vowel, separated by newline.Constraints1 <= T <= 1001 <= N <= 104ExampleInput3smartinterviewsalgorithms

Given a string of characters, find the first repeating character.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each line contains a single string of characters.Output FormatFor each test case, print the first repeating character, separated by a new line. If there are none, print '.'.Constraints1 <= T <= 1000'a' <= str[i] <= 'z'1 <= len(str) <= 104ExampleInput4datastructuresalgorithmssmartinterviewshackerrankOutputa.sa