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
postgres-xl
vuex
switch-material
webfiltering
hard-drive
list-template
air
pyvirtualdisplay
naming-strategy
qsharedmemory
tk
mbtiles
mongodb
flutter-redux
jmx
scraperwiki
mojarra
grok
amd
redeclaration
multibyte-characters
android-relativelayout
libharu
imblearn
telerik-editor
xc16-gcc-1.61
aws-toolkit
xml-layout
equals-operator
asyncimageview