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-artifact-registry
protx
springmockito
appium-android
android-transitions
decentralized-identity
firefox-developer-tools
secure-crt
right-click
private
fsi
appian
smbj
dot.js
mdp
screenshotexception
android-10.0
self-contained
quoting
imagepicker
integromat-apps
lds
jcmd
word-boundary
rate-limiting
htf
ssh-config
uiimagepicker
getproperty
casperjs
