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
azure-devops-rest-api
pdcurses
mapr
wso2carbon
hibernate-envers
excellibrary
orchard-modules
wikimedia-dumps
ieee
kableextra
default-initialization
rabbitmq-c
cordova-3
mediaprojection
defaultdict
simbad
ns-3
flutter-dialog
google-api-dotnet-client
kentico-11
pancakeswap
danger
conv-neural-network
litmus
kotlin-gradle-plugin
pssh
spacy-3
abc
colorbrewer
webpacker