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
swar
widdershins
android-applicationinfo
dynamic-library
android-studio-3.5
interop
heterogeneous
bed
netlogo
makeappx
modeladmin
traffic
glyphrun
quantmod
streamlit
uipinchgesturerecognizer
virus
angular-fullstack
websocket-sharp
serpent
captured-variable
xslt
matlab
kubernetes-rook
usersnap
scoring-profile
telerik
jquery-draggable
linear-interpolation
act-as-taggable-on