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
robocopy
yacas
minimum
airflow
servicecollection
google-indexing-api
gridlayoutmanager
ttk
extjs6-modern
arcpy
libpcap
nsitemprovider
allure
horde
curlpp
shopify-mobile-buy-sdk
android-studio-plugin
focusmanager
final-class
amibroker
async-pipe
pager
concept
devenv
firebase-ab-testing
short-filenames
clipping
physicsjs
webix
jasmine-async