Get Max Points from Sprints

Problem Overview

  • Compute the maximum points by picking exactly k consecutive days across cyclic sprints, where day j of a sprint awards j points.
  • Input: n sprints with durations days[i]; k < total days; schedule repeats; selection may start/end in any sprint or wrap across tournaments. Output: maximum points.
  • Domain: Amazon Care GetFit fitness tournament with daily task points.
  • Sourced from Amazon interviews; a coding interview problem and common interview question.

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Input Variables
Execution Result: