Maximum Task Reward Within a Time Budget
Problem statement
You are given parallel arrays timeCosts and rewards. Task i requires timeCosts[i] units of time and earns rewards[i] reward.
The problem statement continues
ProExamples
Example 1
timeCosts = [2,3,4]rewards = [4,5,7]maxTime = 5return = 9Select the tasks with time costs 2 and 3 for total reward 4 + 5 = 9.
FastPrep 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