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
webresource.axd
libman
powerdesigner
java.nio.file
sfml.net
simbad
dart-flutter-redux
angular-reactive-forms
commonsware
shift-register
msal-react
xperf
data-layers
tadoquery
blpapi
ecmascript-2016
async-ctp
networkonmainthread
hashtag
exiftool
srv
vcftools
ilogger
typedarray
qkeyevent
jolokia
boost-exception
androidappsonchromeos
textfieldstyle
multipartfile