# Tag: LCS

## Longest Common Subsequence of K-sequences

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.

## Longest Repeated Subsequence problem

The longest repeated subsequence (LRS) problem is the problem of finding the longest subsequences of a string that occurs at least twice.

## Longest Palindromic Subsequence using Dynamic Programming

The Longest Palindromic Subsequence (LPS) problem is the problem of finding the longest subsequences of a string that is also a palindrome.

## Longest Common Substring problem

The longest common substring problem is the problem of finding the longest string (or strings) that is a substring (or are substrings) of two strings.

## Longest Common Subsequence | Finding all LCS

Given two sequences, print all the possible longest common subsequences present in them.

## Longest Common Subsequence | Space optimized version

Write space optimized version of LCS problem.

## Longest Common Subsequence | Introduction & LCS Length

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.