Search⌘ K
AI Features

Two City Scheduling

Explore how to minimize total interview costs by assigning candidates to two cities equally using a greedy algorithm. Understand the process of cost evaluation and decision-making to achieve an optimal balanced schedule.

Statement

A recruiter plans to hire n\textbf{\textit{n}} people and conducts their interviews at two different locations of the company. He evaluates the cost of inviting candidates to both these locations. The plan is to invite 50% at one location, and the rest at the other location, keeping costs to a minimum.

We are given an array, costs, where  ...