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
epf
blackberry
owl-api
collectstatic
transparentproxy
alternate
storyboard
primefaces-dataexporter
http-status-code-408
vt-x
flutter-stripe
oracle-cloud-infrastructure
jquery-ui-draggable
android-broadcastreceiver
infinidb
web3dart
geom-point
malloc
file-sharing
id-card
radosgw
coredns
embedded
azure-releases
decimation
python-all-function
xampp
ethercard
aspect
pssnapin