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
autodeploy
metatrader4
timage
protostuff
xbox
google-api-java-client
python-dedupe
prometheus-pushgateway
sammy.js
implicit-declaration
e-commerce
react-bootstrap-nav
system.timers.timer
contentsize
powerpc
proof-assistant
azure-postgresql
dnode
google-play-games
e57
wai-aria
hub
aurelia-fetch-client
aws-java-sdk-2.x
qstandardpaths
quick-score
r-distill
framer-motion
windows-8.1
payara