Given an input string, write a function that will print all the duplicates in that string Example INPUT : “Tutorial cup” OUTPUT : t count = 2 u count = 2 Here, t, u are th duplicate and they ocuured 2 times in the string Time Complexity : O(n) Algorithm …
Given two strings s1 and s2, write a function to say whether s2 is a rotation of s1 or not Example INPUT s1 = “ABCDE” s2 = “DEABC” OUTPUT s1 and s2 are rotations of each other If we rotate s2 we will get s1 Algorithm 1. Concatenate s1 with …
Given a string, write a function to find the first non repeating character Example INPUT s = “tutorial cup” OUTPUT ‘o’ is the first non-repeating character Method 1 Time Complexity : O(n) Algorithm 1. Scan the input string and construct a character count array from input string ie, In the …
Given a string, write a function that will print the words of a string in reverse order Example INPUT s = “tutorial cup makes programming easy” OUTPUT “easy programming makes cup tutorial” Time Complexity : O(n) Algorithm Traverse the string 1. Reverse the individual words 2. After reversing the words, …
Find the shortest substring in a given string that contains all the characters of a given word or Find the Smallest window in a string containing all characters of another string Given two strings s and t, write a function that will find the minimum window in s which will …
Write a program to divide the given string into N equal parts. (N is input) Examples a) Input string : “stringlength”, N = 2 Output : string length b) Input string : “tutorialcup”, N = 3 Output : Invalid input! Because, string cannot be divided into N equal parts. Algorithm …
Print the reverse of a string using recursion. Example a) Input string : Sachin Output : nihcas b) Input string : Code Output : edoC Time complexity : O(n) Algorithm Create Reverse function to reverse string recursively In this function, a. It takes string pointer (str) as input. b. It …
For the given input strings, remove the characters from the first string which are present in second string. (with case sensitivity) Example a) Input string1 : computer Input string2 : cat Output : ompuer After removing characters from string2 (c, a, t) from string1 we get ompuer b) Input string1 …
Given an array which contains strings, this function will sort the array. This can be clearly shown in below example Example INPUT S[] = {“Abhishek”, “Zeroess”,”Hello”,”Amit”,”Bananan”,”Problem”,”Ankush”,”Ahmed”} OUTPUT Abhishek Ahmed Amit Ankush Bananan Hello Problem Zeroess In the above example we can see that the strings in the array are sorted …
Given a string, this function removes all the duplicates in the string and prints the string which has no duplcates. Here, duplicates are the elements which occur more than once in the string Time Complexity: O(nlogn), if we use some nlogn sorting algorithm Algorithm1(Using Sorting) Example INPUT s = tutorialcup …