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
stack-dump
interior-mutability
tasklist
udf
base64
qitemselectionmodel
character
android-native-library
cadvisor
uioutput
buffering
silhouette
azure-policy
background-subtraction
iml
heatmap
xmlseclibs
nats-streaming-server
android-anr-dialog
photo-upload
ckeditor4-react
nscolor
celluloid
npm-run
fabric.io
primitive-types
angular9
azure-authentication
jdom
sql-convert