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
firestorter
azure-app-service-plans
azure-git-deployment
s3-kafka-connector
jquery-hover
kiosk-mode
configure
tvirtualstringtree
macrodef
python-exec
tcheckbox
pyxml
intune
cloudhub
ngx-image-cropper
imp
xbap
copyleaks-api
data-annotations
janus-gateway
backups
instruments
unreachable-statement
smooth-scrolling
programming-pearls
materialdrawer
suid
contextily
pyzmq
swift-package-manager