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
macos-app-extension
facebook-business-sdk
scene
rfc2822
json5
lsmeans
lidr
solid-principles
flutter-health
cold-start
minimum-requirements
google-gsuite
uic
undefined-variable
web-app-manifest
use-strict
plivo
jinjava
coverage
object-reference
ubuntu-20.04
request-promise
project
html-escape-characters
css
scala-2.13
appimage-builder
mvvmfx
fxmlloader
circular-permutations