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
hlsl2glsl
top-n
heap-size
cloneable
l2cap
popperjs
formsflow.ai
sfnetwork
symfony-3.2
azure-pipelines-tasks
bootstrap-select
window-messages
xml-parsing
wif
viewport-units
read-eval-print-loop
bazel-protobuf
two-way
lambda-authorizer
plotly
mat-list
metal-performance-shaders
hasura
thin-client
gdb-python
eo.webbrowser
hashset
input-buffer
facebook-pixel
doskey
