Online Assessment

Online Assessment with a Coordinate-Compression Problem and a Debugging Task

AmazonSoftware Engineer · Online Assessment · Sep 2026

One algorithm question, one project question, an AI-coding debug round. Q1: There are infinitely many bags in a row. Each segment [l, r, v] means bags l through r each hold v dollars. Segments do not overlap, and empty bags count as 0. Pick k consecutive bags and find the maximum total amount, mod 1e9+7. Constraints: n

Shared by a candidate · reported Sep 2026. Interview formats change; use it as a guide, not a script.