Common Substring Problem

String 1:
String 2:
empty bottle
n 0 0 0 0 0 0 0 0 0 0 0 0
e 1 1 1 1 1 1 1 1 1 1 1 1
m 0 2 2 2 2 2 2 2 2 2 2 2
a 0 2 2 2 2 2 2 2 2 2 2 2
t 0 2 2 3 3 3 3 3 3 3 3 3
o 0 2 2 3 3 3 3 4 4 4 4 4
d 0 2 2 3 3 3 3 4 4 4 4 4
e 1 2 2 3 3 3 3 4 4 4 4 5
0 2 2 3 3 4 4 4 4 4 4 5
k 0 2 2 3 3 4 4 4 4 4 4 5
n 0 2 2 3 3 4 4 4 4 4 4 5
o 0 2 2 3 3 4 4 5 5 5 5 5
w 0 2 2 3 3 4 4 5 5 5 5 5
l 0 2 2 3 3 4 4 5 5 5 6 6
e 1 2 2 3 3 4 4 5 5 5 6 7
d 0 2 2 3 3 4 4 5 5 5 6 7
g 0 2 2 3 3 4 4 5 5 5 6 7
e 1 2 2 3 3 4 4 5 5 5 6 7
Back to Jason's CS141 internet extravaganza