Commit 3ff3d10

authored

Create LongestCommonSubstring.txt

1 parent a79eacf commit 3ff3d10Copy full SHA for 3ff3d10

File tree

+13

-0

lines changed

+13

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+Longest Common Substring \| DP-29`
	`2`	`+`
	`3`	`+Given two strings ‘X’ and ‘Y’, find the length of the longest common substring.`
	`4`	`+`
	`5`	`+Examples :`
	`6`	`+`
	`7`	`+Input : X = "abcdxyz", y = "xyzabcd"`
	`8`	`+Output : 4`
	`9`	`+The longest common substring is "abcd" and is of length 4.`
	`10`	`+`
	`11`	`+Input : X = "zxabcdezy", y = "yzabcdezx"`
	`12`	`+Output : 6`
	`13`	`+The longest common substring is "abcdez" and is of length 6.`

Comments

(0)