Solution: Maximum Profit in Job Scheduling

Statement

Suppose there are $n$ jobs, each with a start time, end time, and a corresponding profit. The goal is to schedule these jobs in a way that the sum of their profits is maximized while ensuring that no two jobs overlap in time. Given the arrays of startTime, endTime, and profit, calculate the maximum profit that can be obtained.

Note: Selecting a job that finishes at time $t$ means you can pick the next job that starts at the same time $t$ or later.

Constraints:

• $1 \leq$ startTime.length $==$ endTime.length $==$ profit.length $\leq$ $10^3$

• $1 \leq$ startTime[i] $<$ endTime[i] $\leq 10^5$ ...