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
onenote-api
twilio-php
django-users
daemons
azure-agent
onkeypress
swiftgen
nodejs-express-server
video-gallery
c++builder-xe5
flann
opencv-dnn
find-package
intel-mkl
logstash
networkd3
optics-algorithm
babel-core
aide-ide
http-status-code-405
php-phantomjs
method-cascades
gtoolkit
pact
spring-expression
gsutil
qnamaker
navgraph
cartesian
kubernetes-python-client