Skip to content

Commit b0287b9

Browse files
Create PrintingLongestCommon SubString.txt
1 parent 7c59a38 commit b0287b9

File tree

1 file changed

+14
-0
lines changed

1 file changed

+14
-0
lines changed
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
Print the longest common substring
2+
3+
Given two strings ‘X’ and ‘Y’, print the length of the longest common substring. If two or more substrings have the same value
4+
for longest common substring, then print any one of them.
5+
6+
Examples:
7+
8+
Input : X = "GeeksforGeeks",
9+
Y = "GeeksQuiz"
10+
Output : Geeks
11+
12+
Input : X = "zxabcdezy",
13+
Y = "yzabcdezx"
14+
Output : abcdez

0 commit comments

Comments
 (0)