Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Two City Scheduling

Explore the solution to the Two City Scheduling problem by applying greedy techniques to minimize total costs. Understand how sorting candidates by the difference in invitation costs between two cities leads to an optimal assignment. This lesson helps you implement a strategy to efficiently split candidates evenly between two locations while reducing expenses.

We'll cover the following...

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 costs[i]=[aCosti,bCosti]costs[i] = [aCost_i, bCost_i], the cost of inviting the ithi^{th} person to City ...