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
postmark
mediafire
no-www
object-lifetime
openalpr
user-management
teamviewer
micronaut-data
git-stash
fifo
word-template
ti-nspire
iec10967
sql-server-on-linux
spring-cloud-skipper
react-hook-form
dart-pdf
webpack-bundle-analyzer
flutter-image
zimbra
sentencecase
svelte-component
training
barman
holidays-gem
swig-typemap
lfortran
commandbinding
recordrtc
dimensional-modeling