aboutsummaryrefslogtreecommitdiff
path: root/challenge-018/orestis-zekai/python/ch-1.py
blob: e997db9e74230040e1c7938817b93257c789b83b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# Longest common substring

string1 = "ABABC"
string2 = "BABCA"

max_substring = ""
max_length = -1


for i in range(0, len(string1)+1):
	for j in range(0, len(string1)+1):
		if (string1[i:j] in string2) and len(string1[i:j]) > max_length:
			max_length = len(string1[i:j])
			max_substring = string1[i:j]


print('The longest substring is: ' + max_substring)
print('The length of the longest substring is: ' + str(max_length))