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
lcom
c#-2.0
msbi
amzi-prolog
ora-12514
bluecloth
utl-file
askql
asm.js
google-cloud-memorystore
form-designer
android-buildconfig
core-banking
sonarqube-msbuild-runner
tthread
client-side
getimagedata
hana-xs
modal-popup
key-value-store
secure-random
amazon-app-runner
agentset
delphi-2009
partial-sort
node-mysql2
play2-mini
angular-i18n
bootable
rtd