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
sum-of-digits
multi-table
nstimezone
public-fields
pkcs
createbitmap
google-dfp
module.exports
custom-adapter
azure-webjobs
libgc
react-slideshow-image
fabric
mining
android-scrollbar
extender
activator
activedirectorymembership
racklog
qkeyevent
usb-descriptor
c++builder-6
aframe
segment-io
parametric-equations
static-methods
angular-ui-bootstrap
buttonclick
grpc-gateway
googleauthr