Leetcode 1235. Maximum Profit in Job Scheduling

Choose a subset of non-overlapping jobs (jobs may touch at endpoints) to maximize total profit — the classical weighted interval scheduling problem. With up to 5·10^4 jobs, it requires an O(n log n) approach (sort by time and use DP + binary search or a time-indexed map to find the last nonconflicting job).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1235. Maximum Profit in Job Scheduling

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact