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
cubin
libtorrent-rasterbar
wikitext
cypress-test-retries
openfoam
psalm-php
odt
pnp.powershell
tweets
dice
primeng-table
cubemx
scrollviewreader
go-reflect
intercom-ios
kitti
logical-and
tiddlywiki
casl
wallpaper
social-gaming
databricks
libgit2
vim-plugin
mqttnet
rtsp-client
step
mxchip
bulk-delete
web-content