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
hpcc
hogan.js
xaringan
ggradar
typo3-surf
sqlite3-ruby
hotspot
prepros
ptc-windchill
mongodb-cloud
universal-analytics
react-native-listview
tigase
graphlookup
tun-tap
vera++
sentinel1
duration
dart-null-safety
system.data.oracleclient
applocalizations
openbox
psych
perfino
splunk
php-opencloud
qmessagebox
android-tv
lookup-tables
actioncontroller