Given 2 strings s and t. I need to find for each substring in s edit distance(Levenshtein distance) to t. Actually I need to know for each i position in s what
kdevelop
sed
windows-8
filepicker
wso2-am
boost-iostreams
pico-8
windows-server-2016
bowtie
lowest-common-ancestor
matterport
word-style
google-cloud-nl
block-device
listproperty
mass
jsonnet
string-literals
oracle-graph
reward
rails-models
static-framework
bitrise
arpeggio
target-platform
jasper-plugin
degrees
state-dict
purely-functional
rfc5322