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
weak-references
cockpit
newrelic-synthetics
ngx-build-plus
dnspython
triangular
netflix
hashlib
wkb
react-native-push-notification
vlc-qt
dokku
ihp
skeffectnode
bcnf
curses
urlmon
mongoose-models
mean
max-size
qwizardpage
openlayers-5
java-animation
react-redux-firebase
encapsulation
column-operation
system-font
touch
django-timezone
antplus