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
lustre
lazyvstack
cell
hamlet
wss4j
aws-cdk
tornado-redis
applepayjs
jsbin
mirai
.net-client-profile
postcss-loader
fluxcd
graphql.net
tekton
ziparchive
pdf-parsing
php-mongodb
cordova-plugin-ionic-webview
djangoappengine
gretty
libdl
asp.net-mvc-5
bufferedinputstream
jest-client
hardware-programming
wechat-miniprogram
git-history-rewrite
crash-reports
react-native-tabnavigator