Dunzo SDE OA (2022) | Job Scheduling, Binary Search on Answer, and Backtracking Optimization

Q1. Minimum Time to Finish All Jobs Problem Statement You are given an array jobs where jobs[i] represents the time required to complete the i-th job. There are k workers available. Each job must be assigned to exactly one worker, and a worker can perform multiple jobs. Return the minimum possible maximum working time among all workers after assigning all jobs optimally. Example 1 Input jobs = [3,2,3] k = 3 Output 3 Explanation One optimal assignment: Worker 1 → ...