Amazon

Max-Sum Window over a Compressed Array

Members only

OA Q1 at the hard tier: a sparse array is given as run-length segments ([1,3,4] means indices 1-3 hold value 4; uncovered indices are 0) and the task is the maximum sum over any window of length k. Hi...