Leetcode 1235. Maximum Profit in Job Scheduling
Posted on Thu 06 February 2025 in Leetcode • Tagged with dp, priority-queue
Question Link : https://leetcode.com/problems/maximum-profit-in-job-scheduling/
Difficulty: Hard
Premium: False
Question
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime, endTime and profit arrays, return the maximum profit you can …
Continue reading