## Missing Permutations in a list

Given a list of permutation of any word. Find the missing permutation from the list of permutation. Examples: Input : Permutation_given[] = {“ABCD”, “CABD”, “ACDB”,… Read More »

Given a list of permutation of any word. Find the missing permutation from the list of permutation. Examples: Input : Permutation_given[] = {“ABCD”, “CABD”, “ACDB”,… Read More »

Given a string W, change the string in such a way that it does not contain any of the “forbidden” strings S1 to Sn as… Read More »

Given a binary string containing only 0’s and 1’s. Write a program to find number of sub-strings of this string whose decimal representation is odd.… Read More »

Suppose we have given a String in which some ranges as specified and we have to place the numbers which is between the given range… Read More »

Given a string str, we need to print reverse of individual words. Examples: Input : Hello World Output : olleH dlroW Input : Geeks for… Read More »

Given a string s, find the number of pairs of characters that are same. Pairs (s[i], s[j]), (s[j], s[i]), (s[i], s[i]), (s[j], s[j]) should be… Read More »

Pre-requisite: Suffix Array. What are k-mers? The term k-mer typically refers to all the possible substrings of length k that are contained in a string.… Read More »

Given a string str of size n. The problem is to print all the palindromic permutations of str in alphabetic order if possible else print… 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… Read More »

You are given a string S, and a list of words L i.e array/vector of strings (Words in list L are all of the same… Read More »

Given two strings S and T, find a string of the same length which is lexicographically greater than S and smaller than T. Print “-1”… Read More »

Given a string str of length n. The problem is to find the length of the longest sub-string in str having frequency of each character… Read More »

Given two strings str1 and str2 of length n1 and n2 respectively. The problem is to count all the subsequences of str1 which are anagrams… Read More »

Given a string S, change the smallest number of letters in S such that all adjacent characters are different. Print the resultant string. Examples :… Read More »

n people are standing in a queue to buy entry ticket for the carnival. People present there strongly believe in chivalry. Therefore, at time =… Read More »