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-trends
xcode-debugger
reloading
swagger-akka-http
donations
codehighlighter
scikit-build
azure-china
automated-tests
ef-bulkinsert
branching-and-merging
sim800
react-draft-wysiwyg
phpdocx
flow-diagram
code-composer
youtubeplayer
spineless-tagless-graph
cognos-10
react-native-flash-message
rubber
node-ffi
coin-change
closedxml
alation
comparison
android-radiobutton
rust-cargo
gnokii
qqmlcomponent