← Questions
Dot product of run-length encoded vectors
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A very long integer vector has many repeated values. Design a compact representation for it (for example, runs of value and count), then compute the dot product of two vectors stored that way without expanding them. Give the complexity in terms of the number of runs.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding