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
spatie-ssh
nsexception
uia
python-socketio
programdata
filter-woocommerce
pine-editor
dynamics-365-sales
taylor-series
tspl
fastly
boxconstraints
long-lines
entity-model
asp.net-core-2.0
jcodemodel
scopt
webspeech-api
grpc-node
sfcalendar
pcre2
angular-masonry
passthrough-attributes
codeception
ziggy
android-bottomnavigationview
kiosk-mode
netcdf4
cypress-component-test-runner
pigpio