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
codeql
jax-ws
ttk
static-language
python-tenacity
mongodb-charts
chromium-portable
bit-masks
name-hiding
jsfl
nstablecolumn
fullstory
shapely
doctrine-migrations
route-parameters
seven-segment-display
tabnine
c#-record-type
android-mipmap
wms
.bash-profile
ytt
adbwireless
odoo-12
qnx-neutrino
yagmail
scikit-learn-pipeline
dtd-parsing
azure-application-settings
endpoint-for-defender
