In the given stream of characters(string), find the first non-repeating character. Example Input string : ababcef Output : c Time complexity : O(1) Algorithm Here we use doubly linked list, The DLL contains all non-repeating character in order. 1. Create an empty DLL, array inDLL[] and repeated[] of size of …
Problem Statement In the “Online Algorithm for Checking Palindrome in a Stream” problem, we have given a stream of characters(charcaters are received one by one). Write a program that will print ‘yes’ every time if the received characters till now form a palindrome. Input Format The first and only one …
Problem Statement In the “Check if Two given Strings are Isomorphic to each other” problem we have given two strings s1 and s2. Write a program that says whether the given strings are isomorphic or not. Note: Two strings are said to be isomorphic if there is a one to …
Problem Statement In the “Length of Longest valid Substring” we have given a string that contains the opening and closing parenthesis only. Write a program that will find the longest valid parenthesis substring. Input Format The first and only one line containing a string s. Output Format The first and …
Given a string which contains special characters(such as %,&,*,^,$) and alphabets(‘a’ to ‘z’ and ‘A’ to ‘Z’), write a function that will reverse the string in a way that special characters are not affected Example INPUT s = “a!@bc&d” OUTPUT “d!@cb&a” Method 1(Simple Solution) Algorithm 1. Create a auxilary string …
Given two strings s1 and s2, write a recursive function that returns TRUE if s2 is present in s1 Example INPUT s1 = “tutorial cup” s2 = “cup” OUTPUT TRUE Algorithm 1. If current character of s2 is last character of s1, but s2 has more characters then return FALSE …
Write a function to find lexicographically minimum string in a circular string(array). Example a) Input string : CDAABD Output : AABDCD b) Input string : CDAB Output : ABCD Time complexity : O(n2logn) Algorithm 1. Create an array of strings to store all rotations. 2. Create a concatenation …
Given a string which represent a number, we need to write a function to find the number of sub-strings of the given string that add up to 9. Examples a) Input string : 7299 Output : 6 Here, there are 6 substrings which recursively add up to 9 Sub-strings are: …
Check whether the given string is palindrome or not. Given string is form of positive number. Palindrome: If we reverse the string if it looks the same then it is called as palindrome. Examples Time complexity : O(n) Algorithm a. Copy the number and store it in temp. b. Create …
Given array of strings, write a function that will print the smallest string that contains each string in the array as substring Example INPUT arr[] = {“catlog”, “dog”, “loggk”, “xcatdo” } OUTPUT “catloggkxcatdog” In the output string, all the strings in the given array are substrings Algorithm 1. Create a …