ORACLE FINANCIAL SERVICES OA 2024 | Maximum Profit in Job Scheduling | DP and Binary Search

Problem Statement You are given: startTime[i] endTime[i] profit[i] Choose a subset of non-overlapping jobs such that total profit is maximized. Return the maximum profit obtainable. Example Input startTime = [1,2,3,3] endTime   = [3,4,5,6] profit    = [50,10,40,70] Output 120 Explanation Choose jobs: (1,3,50) (3,6,70) Total Profit = 120