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
npm-pack
material-design-lite
attention-model
poker
client-hints
touchstart
slash
android-bluetooth
log-viewer
aws-regions
cairo
dbmail
nest
merlin
adjacency-list-model
apache-commons-vfs
spim
digest
openpower
refit
pinescript-v5
corda
light
duplicate-symbol
hsm
orientjs
delphi-10.1-berlin
ado
embedded-fonts
zipinputstream