Given two strings s1 and s2, write a function that will convert s1 to s2(if possible) by using only one opeartion. The operation is to pick any character from s1 and insert it at front of s1. Print the number of operations that took to convert. Example INPUT s1 = …
Given a string of odd length, write a function that will print the string in X format as show below Example INPUT s = “abcde” OUTPUT a e b d c b d a e Algorithm 1. Traverse the string with two varaiables, i and j, where i is increasing …
Check if the input string can be rearranged such that it can be a palindrome. Example Input string : “abb” Output : True Because, it can be rearranged as “bab” which is palindrome. Time complexity : O(n) Algorithm a. Create a count array, store the count of all the characters. …
Write a function which converts the given string(which represents an integer) to its value. Example Input string : “3486” Output : 3486 Time complexity : O(n) Algorithm For positive integers, a. Initialize result = 0. b. Traverse the string. c. For every character in the string, result = result*10 + …
Find the lexicographic rank of a string. (string without duplicates) Example Input string : “CAB” Output : Rank is 5 Total possible permutations are : ABC, ACB, BAC, BCA, CAB, CBA(lexicographic order) Therefore, rank is 5 Time complexity : O(n) Algorithm a. Initialize rank = 1. b. Traverse in the …
Given a string, write a function that will print the given string without spaces Example: INPUT : s = “tu to rial cup” OUTPUT : “tutorialcup” Time Complexity: O(n) 1. Traverse the string with two indexes ie, i for traversing and j for storing chars in output string 2. If …
Given a string, write a function that will return TRUE if it is a rotation of any palindrom else return FALSE Example 1 INPUT : s = “cbbcd” OUTPUT : TRUE In the above example, the given string “cbbcd” is a rotation of a palindrom “bcdcb” Example 2 INPUT : …
Given an array of strings, write a function to sort them alphabetically Example INPUT : arr[] = {“bekz”,”bcdk”,”akleedf” } OUTPUT : “akleedf” , “bcdk”, “bekz” Here, in above example we can see first string will be “akleedf” as ‘a’ comes first in order. For the next two strings ‘b’ is …
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 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) …