Given a string str. The task is to check whether this string can be splitted into two strings X and Y such that Y is a substring of X X + Y = str (Here, X+Y means X and Y are concatenated) Examples : Input: pleaselea Output: Yes str = “please” + “lea”, Here “lea” is a substring… Read More »
Given a Binary String S of length N which consists of only 0 and 1, the task is to remove minimum number of 0’s from the string such that all 1’s form a contiguous subsegment. Return numbers of 0’s which are removed, if the string is already having all 1’s in contiguous format return -1. Examples: Input :… Read More »
Given two lowercase alphabet strings s and t return whether you can create a 1-to-1 mapping for each letter in s to another letter (could be the same letter) such that s could be mapped to t, with the ordering of characters preserved. Input: s = “coco”, t = “kaka” Output: True Explanation: We can create this mapping:… Read More »
Given a string S containing 0’s and 1’s, the task is to find the length of longest continuous substring of 0’s from the given string. Examples: Input: S = 1111111 Output: 0 Explanation: There is no substring of 0’s hence output is 0. Approach: The given problem can be solved by simply iterating through the string. Follow the… Read More »
Given n strings in any order. Sort all the strings (lexicographically), but if a string is present completely as a prefix in another string, then string with larger length should come first. Examples: Input : 3 cap apple captain Output : apple captain cap Explanation: cap is present in captain as a prefix, so string : captain being… Read More »
Given 2 strings A and B, the task is to count the number of substrings of A which are also present in B. Example: Input: a=”plu” b=”Cplusplus” Output: 6 Explanation: p, l, u, pl, lu, and plu are the 6 substrings of string a present in string b also. Approach: We will just run 2 loops and find… Read More »
Given a string A, compute the minimum number of characters you need to delete to make resulting string a palindrome. Examples: Input : baca Output : 1 Input : cplusplus Output : 6 Below approach will use modified Levensthein distance. We would like to pass to modified Levensthein both original string and its reverse. C++ Implementation: Output: To… Read More »
In C programming language, a string is a sequence of characters that are stored in an array of characters. The string is terminated with a null character (‘\0’) which marks the end of the string. In C, strings are stored as arrays of characters, and each character in the array represents a character in the string. For example,… Read More »
A string contains ‘0’ and ‘1’.You have to find out whether the string is dangerous or not. The string will be dangerous in the following two conditions. There are at least 7 continuous occurrences of ‘1’. There are at least 7 continuous occurrences of ‘0’. Examples: Input : 1000000001 Output : YES Explanation: It has more than 7… Read More »