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
android-architecture-components
maintenance
grunt-contrib-compass
open-nfc
customer
sql-in
pg-catalog
line-height
graphplot
tez
xml-twig
adbannerview
grape-api
factory-bot
servicestack
bufferedinputstream
flasgger
strstr
bscscan
accurev
iorderedqueryable
coursera-api
virus-scanning
gprof
iso
asp.net-core-viewcomponent
dart2native
domain-masking
snapstodevicepixels
easeljs