Find a Maximum-Sum Window in a Sparse Array
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Online Assessment
Overview: Find the maximum sum of any fixed-length window in an enormous sparse array represented by nonoverlapping constant-value segments. Sweep compressed breakpoints or use interval prefixes so runtime and memory depend on the segments rather than the full array length.
Read the full Amazon Software Engineer interview experience this question came from
