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
uiviewanimation
function-fitting
laravel-filters
amazon-ec2">amazon-ec2
gtfs
block-device
insert-statement
structured-array
svn-merge
crossmint
surrogate-key
wordpress-json-api
interruption
keycloak-rest-api
jet-sql
knox-gateway
dunn.test
defaultmutabletreenode
infrastructure-as-code
qwik
httpresponse
postman-mocks
adsi
timelapse
mqtt
corda
mpmath
filesystems
toml
npm-build