Amazon Interview Question

Given a sparse array, find the maximum-sum contiguous window of size k efficiently.