NeetCode #706LC-1235Hard1-D Dynamic Programming
← Back to All Problems#706 · #1235 · Maximum Profit in Job Scheduling(规划兼职工作)
📌 Problem Statement & Constraints
Given
startTime, endTime, and profit for n jobs, choose a subset of non-overlapping jobs (a job ending at time t does not conflict with one starting at t) that maximises total profit. Return that maximum profit. Constraints: 1 <= n <= 5 * 10^4, 1 <= startTime[i] < endTime[i] <= 10^9, 1 <= profit[i] <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!