Given a string, write a function to eliminate all “b” and “ac” in the string NOTE : we should traverse the string only once and no extra space is allowed Method 1 In this method we will remove ‘ac’ only if ‘a’ and ‘c’ are consecutive Example INPUT : s …
Given two strings s1 and s2, where s1 contains wild card characters and s2 is a normal string. Write a function that will return true if both the given strings match The following wildcard characters are allowed ‘*’ = Matches with zero or more instances of any character or set …
Given a string, write a function that will find the longest palindromic substring Example INPUT s = “ebcdcbn” OUTPUT “bcdcb” is the longest palindromic substring Method 1(Brute Force) : In this method we will pick all the substrings and check whether the substring is palindrom or not Time Complexity: O(n^3) …
Write a function to find if a given string C is interleaving of other two given strings A and B. Interleaving : C is said to be interleaving of A and B, if it contains all characters of A and B, order of all characters in individual strings (A, B) …
For the given input string, print all the possible permutations. Repetition of characters is allowed. We should print them in lexicographic order. Example a. Input string is: AB Output: AA AB BA BB Total 4 permutations. b. Input string is: ABC Output: AAA, AAB, AAC, ABA, ABB, ABC, ACA, ACB, …
Run length encoding on the given input string. Example Input string is : “aaaabbbddddzz” Output string : a4b3d4z2 Here, a is coming 4 times, b is coming 3 times, d is coming 4 times and z is coming 2 times. Time complexity: O(n) Algorithm 1. Pick the first character from …
In the given list of items, print all the items which contains all the characters of the given word. Example Given word is: pro List of items: [program, programming, computer, rope, coding] Output: program, programming, rope Time complexity: O(m + n), m is total number characters in the list of …
Given a string, write a function that will print all the permutations of the string Example INPUT s = “ABC” OUTPUT ABC, ACB, BAC, BCA, CBA, CAB Time Complexity : O(n*n!) Note : There are n! permutations and it requires O(n) time to print a permutation. Algorithm Permute() 1. If …
Given two strings s1 and s2, write a function that says whether the two strings are anagram or not s2 is said to be a anagram if it contains same characters that of s1, but order can be different Example 1 INPUT s1 = “abcd” s2 = “cdbe” OUTPUT Given …
Given two strings s1 and s2, write a function that will print all the interleavings of the given two strings. Here interleaving string is a string which has the same order that of individual strings. In the below example, we can see that ‘A’ will always comes before ‘B’ and …