Given two strings S and T, find the length of the shortest subsequence in S which is not a subsequence in T. If no such… Read More

# Tag Archives: LCS

Given two strings ‘str1’ and ‘str2’ of size m and n respectively. The task is to remove/delete and insert the minimum number of characters from/in… Read More

Given two strings of lower alphabet characters, we need to find the number of ways to insert a character in the first string such that… Read More

Given 3 strings of all having length < 100,the task is to find the longest common sub-sequence in all three given sequences. Examples: Input :… Read More

You are given two strings. Now you have to print all longest common sub-sequences in lexicographical order?Examples: Input : str1 = "abcabcaa", str2 = "acbacba"… Read More

Given two strings in lowercase, find the longest string whose permutations are subsequences of given two strings. The output longest string must be sorted. Examples: … Read More

Given two strings X and Y, and two values costX and costY. We need to find minimum cost required to make the given two strings… Read More

Given a string, find out if the string is K-Palindrome or not. A K-palindrome string transforms into a palindrome on removing at most k characters… Read More

Given two strings X and Y, print the shortest string that has both X and Y as subsequences. If multiple shortest super-sequence exists, print any… Read More

Prerequisites : LCS, LIS Given two arrays, find length of the longest common increasing subsequence [LCIS] and print one of such sequences (multiple sequences may… Read More

Given a string S, find out if the string is K-Palindrome or not. A K-palindrome string transforms into a palindrome on removing at most K… Read More

Given two strings, find the length of the longest subsequence present in both of them. Examples: LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH”… Read More

Given two strings str1 and str2, the task is to find the length of the shortest string that has both str1 and str2 as subsequences.… Read More

Given two sequences, print the longest subsequence present in both of them. Examples: LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3. … Read More

We have discussed Overlapping Subproblems and Optimal Substructure properties in Set 1 and Set 2 respectively. We also discussed one example problem in Set… Read More