Workload Distribution: Assign Tasks to Workers to Minimize Maximum Load

Round 1 - Coding Problem Given a list of tasks with integer costs and k workers, assign every task to exactly one worker to minimize the maximum total cost assigned to any single worker. Example Approach Binary search on the answer X. Check feasibility: can all tasks be assigned with no worker exceeding X? Use greedy packing. Follow-ups Walk through why binary search on the answer works here. What are the search bounds? How does the problem change if each worker can take at most m tasks, regardl…