Longet Common Substring (Problem 45) - InfyTQ Solution in Python

Longet Common Substring (Problem 45)

InfyTQ Solution in Python

PROBLEM STATEMENT

UC Berkley CS61A Fall 2011 Midterm 2

Write a function longest_common_substring that takes two strings word1 and word2 and returns the maximum overlap between the strings.

Sample Input	Expected Output
'pirate', 'teepee'	'te'
'fish', 'bowl'	''
'assured', 'measured'	'sured'
'catenation', 'concatenation'	'catenation'

---

SOLUTION

#PF-Prac-45 def longest_common_substring(string1, string2): answer = "" len1, len2 = len(string1), len(string2) for i in range(len1): for j in range(len2): lcs_temp=0 match='' while ((i+lcs_temp < len1) and (j+lcs_temp<len2) and string1[i+lcs_temp] == string2[j+lcs_temp]): match += string2[j+lcs_temp] lcs_temp+=1 if (len(match) > len(answer)): answer = match return answer output=longest_common_substring("discatenation","concatenation") print("The longest overlap of characters between string1 and string2:",output) output1=longest_common_substring("assured","measured") print("The longest overlap of characters between string1 and string2:",output1)

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.