Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# A Space Optimized Solution of LCS

Given two strings, find the length of longest subsequence present in both of them. Examples: LCS for input Sequences &#x201C;ABCDGH&#x201D; and &#x201C;AEDFHR&#x201D...

# LCS (Longest Common Subsequence) of three strings

Given 3 strings of all having length &lt; 100,the task is to find the longest common sub-sequence in all three given sequences. Examples: Input : str1 = &quot;geeks&q...

# LCS formed by consecutive segments of at least length K

Given two strings s1, s2 and K, find the length of the longest subsequence formed by consecutive segments of at least length K. Examples: Input : s1 = aggayxysdfa ...

# Longest Common Increasing Subsequence (LCS + LIS)

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

# Count ways to increase LCS length of two strings by one

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 length of LCS of both strings i...

# Number of ways to insert a character to increase the LCS by one

Given two strings A and B. The task is to count the number of ways to insert a character in string A to increase the length of the Longest Common Subsequence between ...