Problem · Array
Book Reading Evenings
● Easy
GoogleINTERNOA
See Google hiring insightsGoogleINTERNOAProblem statement
A book contains chapters that must be read in order. The integer array chapter gives the minutes needed to finish each chapter, and evening[j] gives the minutes available on the j-th evening.
During each evening, read as many consecutive unread chapters as possible. A chapter may be started only when it can be finished during that same evening, so a chapter is never split across evenings. Any unused time at the end of an evening is discarded.
The problem statement continues
ProExamples
Example 1
chapter = [30,20,10]evening = [50,10]return = 2The first two chapters exactly fill evening 1. The final chapter is completed on evening 2.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week