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
bluebird
fifo
apache-arrow-cpp
stdout
internal
control-charts
null-terminated
attunity
secp256k1
autoit-c#-wrapper
moby
rxtx
nes
vhosts
android-7.1-nougat
concurrent-programming
facebook-ads
openshift-pipelines
jdbcrealm
cube.js
gulp-sourcemaps
flink-broadcaststate
zgrep
stringindexoutofbounds
twitter-bootstrap-wizard
flatpickr
github-enterprise">github-enterprise
codesmith
angular-routing-parameter
facebook-business-sdk