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
showtext
data-vault
document-root
autocomplete-fields
backend
structure
ios-permissions
perl
infix-operator
timeuuid
sensorkit
pixmap
jndi
angular-http-server
binding.pry
lookup-tables
spatie-ssh
double-double-arithmetic
lua-scripting-library
navgraph
high-contrast
cells
dialogflow-cx
achartengine
kronos-workforce-central
mpld3
webmail
write-host
entity-framework-core-2.1
gamekit
