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
agens-graph
automount
universal-ctags
use-form
capped-collections
vip-architecture
vue-slot
feathericons
stack-smash
bam
cqlsh
unsubscribe
nrwl
verification
scope-chain
google-cloud-network-load-balancer
mdf
react-widgets
aiopg
jdbc-pool
miniupnpc
scheduled-tasks
mongodb-lookup
ntlm
nestedrecyclerview
maven-cobertura-plugin
firemonkey-style
cleditor
stdafx.h
wicket-1.6