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-managed-identity
mock-aws-s3
c++-winrt
flat
custom-activity
principalcontext
coordinate-systems
back-stack
array-combine
sql-like
sfml.net
jurassic
visual-c++
searchfiltercollection
eclipse-hawkbit
dub
processr
android-dark-theme
android-inflate
itemssource
compiledebugjavawithjavac
dynamic-language-runtime
jsapi
dio
antisamy
0kb
evolutionary-algorithm
nsarraycontroller
calicoctl
svg-defs
