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
inheritance
nonlinear-functions
pointer-address
shopping-cart
argo-cron-workflows
contentobserver
php-parse-error
nhydrate
vertical-scroll
bindingnavigator
mousearea
cmock
compass-geolocation
nsubiquitouskeyvaluestore
qfile
qquickitem
hidl
argument-unpacking
mts
numerical-computing
coding-style
kubernetes-label
string-parsing
payload
cubical-type-theory
trend
dynamic-typing
signed-apk
nsviewrepresentable
jquery-upload-file-plugin
