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
uilistcontentconfiguration
intersect
shopify-javascript-buy-sdk
dronekit-python
container-image
arraybuffer
texel
catiledlayer
struts2-jquery-plugin
refinitiv-eikon-api
connection-pooling
amp-story
type-narrowing
scriptprocessor
vue-carbon
label-encoding
fiddle
android-notification-bar
pyupdater
function-composition
huawei-mobile-services
enterprise-guide
html-entities
qtcharts
datetimerangefield
vertex-cover
amba
itemtemplate
multi-touch
cs50