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
network-error-logging
insert-select
react-native-notifications
hashref
xpathnavigator
android-internal-storage
bed
mix-and-match
scalr
password-hash
tesla
relocation
setup.py
devtools
masm32
bcnf
jose
telecom-manager
query-hints
resource-leak
android-concatadapter
continuation
weaving
flowchart
adaptive-icon
asp.net-core-1.1
umzug
resourcestring
prestashop
haml
