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
loadingbar.js
jet-engine
native-web-component
spotlight-dbpedia
grpc-gateway
transcoding
imageai
dirent.h
single-file-generator
embedded-fonts
vstack
osdev
wxstring
integrated-security
pid-controller
ontouchstart
rubber-band
partial-index
ocelot
viewmodelproviders
kaboom
expansion-tile
kernel
djongo
python-asyncio
qspinbox
screen-scraping
filestreamresult
eclipse-marketplace
equalizer
