Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 51ee88a

Browse files
Add files via upload
1 parent b31a200 commit 51ee88a

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed

‎Problem Statement/Print_LCS.txt‎

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
Print Longest Common Subsequence:
2+
LCS Problem Statement: Given two sequences, find the longest subsequence present in both of them and Print them.
3+
A subsequence is a sequence that appears 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.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /