Commit d484809

authored

Create LongestCommonSubsequence.txt

1 parent 609e249 commit d484809Copy full SHA for d484809

File tree

-0

lines changed

-0

lines changed

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,7 @@`
	`1`	`+Longest Common Subsequence:`
	`2`	`+LCS Problem Statement: Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears`
	`3`	`+in the same relative order, but not necessarily contiguous. For example, "abc", "abg", "bdf", "aeg", ‘"acefg", .. etc are subsequences of "abcdefg".`
	`4`	`+`
	`5`	`+Example:`
	`6`	`+LCS for input Sequences "ABCDGH" and "AEDFHR" is "ADH" of length 3.`
	`7`	`+LCS for input Sequences "AGGTAB" and "GXTXAYB" is "GTAB" of length 4.`

Comments

(0)