Walmart SDE Interview Question 2024 October | Dynamic Programming & Binary Search | Off-campus

Question 1: Maximum Profit in Job Scheduling Problem Statement 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 take such that there are no two jobs in the subset with overlapping time ranges. If you choose a job that ends at time X, you will be able to strictly start another job that begins ...