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
oci8
object-hash
drools
.mov
abstract-machine
modelmultiplechoicefield
linux-mint-19
collaborative-filtering
testrigor
floor-division
nco
careplicatorlayer
upnpx
linq-method-syntax
call-hierarchy
cubic-bezier
http-status-code-504
logits
bpp
razorpay-andoid-sdk
system-administration
occlusion-culling
prettyphoto
eudyptula-challenge
outline-view
microsoft-partnercenter-java
asp.net-web-api
azure-pipelines-task-lib
azure-blueprints
msbuild-14.0