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
content-pages
alertmanager
templates
r2d2
webstorm
imei
nslayoutanchor
flask-oidc
redpitaya
count-unique
changelog
callback
makemaker
python-importlib
lettuce
decentraland
nativescript-plugin
acrobat
uaprof
conan
mappings
vector-processing
react-router-v5
qimagereader
clock
cs-cart
grid-system
native
flutter-get
ringcentral-webhooks
