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
wbwebviewconsole
radeditor
officedown
soundpool
decrement
heroku-cli
routerlink
postgres-plpython
offlineapps
outbox-pattern
pandapower
telegraph
openfx
fat
widgetsbinding
close-button
chakra
forge2d
woocommerce-bookings
android-screen
unapply
twilio-frontline
ringcentral-webhooks
react-link
keystonejs6
requests-futures
rich-text-editor
nimbus
lmtp
nsviewrepresentable
