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

Two City Scheduling

Explore the Two City Scheduling problem where you must minimize the total cost of inviting candidates to two locations. Learn to apply greedy algorithms to ensure exactly half of the candidates are assigned to each city, balancing cost and constraints effectively.

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