FastPrepMaximum Profit from Non-Overlapping Jobs

Maximum Profit from Non-Overlapping Jobs

Google logoGoogle● HardFULLTIMEONSITE INTERVIEW

Problem statement

Job i starts at startTime[i], ends at endTime[i], and earns profit[i]. Choose a subset of non-overlapping jobs with maximum total profit.

The problem statement continues
Pro

Examples

Example 1

startTime = [1,2,3,3]endTime = [3,4,5,6]profit = [50,10,40,70]return = 120

Select jobs [1,3] and [3,6].

FastPrep Pro
Reported in 1 Google interview this week

Unlock 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
See Google hiring insights
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Google interview this week

Unlock 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