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
react-font-awesome
unisharp-file-manager
count
facebook-apps
code-hinting
delphi-5
fundingchoices
jose4j
sonarqube5.1.2
edify
office365-apps
eager
visnetwork
htmlpurifier
httponly
flags
mathematical-optimization
drwatson
ios-extensions
linear-equation
universal-reference
fileserver
math.sqrt
bit.ly
uibackgroundtask
solaris-studio
cloc
createoleobject
docker-desktop
visual-c++