Algorithm · Snowflake · Hard
Coding Software Engineering You have n jobs, described by the three arrays startTime, endTime, and profit. For job i, its start is startTime[i], its finish is endTime[i], and its payment is profit[i]. Choose any collection of jobs that do not overlap so that their combined profit is as large as possible. A job that begins at time x is compatible with a job that finishes at time x. Return the greatest total profit available. Examples Example 1: Input: startTime = [2,4,6,6],…
Checking your access…