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
shinyvalidate
directadmin
servicenow-rest-api
swiftui-text
binderhub
usb4java
alt+shift+r
object-layout
rtcp
angular-service-worker
energyplus
html-escape
streamwriter.write
dbutils
spring-cloud-kubernetes
python-beautifultable
python-vlc
date-patterns
pycassa
facebook-messages
dfa
minmax
connector
autoquery-servicestack
nsfontmanager
okta-spring-boot-starter
google-nearby-connections
graphql-federation
avl-tree
rxjs7