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
express
fast-endpoints
aiogram
javafx-webengine
nexus2
github-api-v3
resharper-plugins
directory-structure
geronimo
geometry-surface
cloudhub
crostini
input-split
git-ls-remote
automapper-6
directoryindex
pg-upgrade
xla
avaudioengine
yii-url-manager
urlclassloader
360-degrees
semantic-ui-react
console-scraping
live-preview
redmine
phpfox
dtls
tombstone
javax