DE Shaw OA 2023 | Binary Search on Answer Space | On-campus

Question 1: Cabinets Partitioning Problem Statement You are given a job that has been divided into N tasks. The tasks cannot be divided any further. Each of the N tasks takes S[i] number of seconds to complete. Your job will be completed when all tasks are completed. You have K workers at your disposal. But as per the nature of the job, a worker can only be allocated continuous tasks. A worker can work only on a single task at ...