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
google-cloud-api-gateway
splitchunksplugin
cd
scratchpad
trusted-execution-environment
tinyint
indentation
nodatime
browsable
facebook-pixel
mongo-connector
iphone
delphi-11-alexandria
watchman
zerorpc
tauri-js
zero
benchmarking
ordereddictionary
multipart-mixed-replace
call-by-value
loadjava
constraintlayout-barrier
ansible-module
knife-solo
live-wallpaper
nelmioapidocbundle
tdictionary
code-structure
qmap