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
usbmanager
invoice
.net-core-publishsinglefile
hadoop
facebook-messages
r5r
acr122
freezed
n-gram
azure-functions
python-fabric-2
array-initialize
kubuntu
webrtc
dput
reactivex
firemonkey-fm3
delphi-run-time-library
targetinvocationexception
mini-httpd
gridjs-react
graphql-playground
data-driven-tests
qfiledialog
devexpress-mvc
qinputdialog
chatbase
language-ext
react-select-plus
dotpeek