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
android-appwidget
android-os-handler
pandas-settingwithcopy-warning
nagle
rosette
odo
android-runonuithread
login-system
mvc-editor-templates
adox
replicaset
backgroundtaskidentifier
qmdiarea
metrics-server
status-update-notification
packing
hdevelop
pseudocode
android-4.0.3-ice-cream-sandwich
google-speech-api
compiler-services
rtos
angular-strap
simplemodal
holoviz-panel
cryptography
dotnet-core-pack
domino-designer-eclipse
google-cloud-nl
angular-ui-sortable