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
visual-studio-loadtest
util.promisify
kismet-wireless
ironwebscraper
rcp
datarowcollection
multiple-repositories
sapjco3
mod-proxy-html
svm
magit
jquery-ui-tooltip
queued-connection
libxl
umount
opencart-3
cypress-intercept
ssas-2016
coded-ui-tests
apigee127
sqlprofileprovider
kss
uinput
mpmediaplayercontroller
emacs
asp.net-mvc-5
android-designer
discrete
names
monaco-editor