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
nsfilepromiseprovider
minidump
tfsec
stimulusjs
wcf-web-api
ti-basic
grafana-loki
wunderbar
ssim
spectator
angular-social-login
geoip
eula
taylor-series
printstream
preferencefragmentcompat
hbase-shell
f5
acfpro
enchant
array-pointer
createbitmap
mysql-error-1293
pg-dumpall
imread
system.windows.controls.ribbon
clojurescript-javascript-interop
dynamic-linq-core
react-router-component
facebook-customer-chat