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

Solution: Two City Scheduling

Explore how to apply a greedy algorithm to the Two City Scheduling problem for minimizing total interview costs. This lesson guides you through sorting candidates by cost differences and allocating half to each city to achieve optimal results.

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 ...