Solution: Two City Scheduling

Explore how to solve the Two City Scheduling problem by applying a greedy approach that sorts candidates based on their cost differences between two cities. Understand the step-by-step process to minimize interview costs by assigning half the candidates to each city optimally. This lesson helps you master an efficient algorithmic pattern useful in coding interviews.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

A recruiter plans to hire $\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 $costs[i] = [aCost_i, bCost_i]$ , the cost of inviting the $i^{th}$ person to City $A$ is $aCost_i$ ...