FastPrep
Problem · Array

Minimum Daily Printing Limit

Learn this problem
● MediumAgodaONSITE INTERVIEW

Problem statement

You are given an array pages, where pages[i] is the number of pages in chapter i, and an integer days.

Chapters must be printed in order, and a chapter cannot be split across days. Return the minimum daily printing limit needed to finish all chapters within days days.

Function

minimumDailyPrintingLimit(pages: int[], days: int) → int

Examples

Example 1

pages = [100,200,300,400]days = 3return = 500

With limit 500, the chapters can be printed as [100,200], [300], and [400]. Any smaller limit cannot keep the schedule within 3 days.

More Agoda problems

drafts saved locally
public int minimumDailyPrintingLimit(int[] pages, int days) {
  // write your code here
}
pages[100,200,300,400]
days3
expected500
checking account