Amazon Online Assessment: Maximize Sum of Consecutive Bags in Financial Data

Solve Amazon OA1 challenge: find k consecutive bags with maximum money from non-overlapping segments in an infinite sequence. Efficient algorithm needed.