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
idatareader
crudbooster
avalonia
pfx
aec
scribus
perspectivecamera
android-coroutine
serve
jpype
sqlitemanager
swiftui-list
activerecord-typedstore
spdlog
mongodump
redmi-permission
go-map
htc-vive
react-native-iap
parallel-processing
ef-core-2.1
login
malsup-ajax-form
react-testing
osascript
xtemplate
amazon-linux-extras
time-complexity
jwk
odoo-product-configurator