Impetus Campus 2026 | Coding Assessment | Complete Solutions & Tips | Weighted Interval Scheduling DP | Nov 22nd Assessment

Question 1: Hard Worker Problem Statement: You have N tasks such that the i^th task takes time from minute L[i] to minute R[i] (inclusive). You will get paid A[i] dollars for doing the i^th task. You need to be available for work at the factory from minute L[i] to minute R[i] to get paid for a task. Let X be the maximum amount of dollars you can get by completing the tasks. Similarly, let Y be the minimum possible total ...