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
netcdf-java
sh
haskell
hydra-python
maven-indexer
timedelta
mysql-error-1045
kendo-ui-window
wix-react-native-navigation
quickinfo
uvcvideo
watir
mcsession
aiff
dse
sigaction
dot42
live-share
jpm
aio
inherited
rd
renderaction
azure-anomaly-detection
facet
vuepress2
uniform-server
udpipe
requestjs
dynamic-memory-allocation