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

Two City Scheduling

Explore how to apply greedy algorithms to solve the Two City Scheduling problem. Understand how to optimally assign candidates to two locations to minimize total costs while meeting constraints. This lesson helps you develop a strategic approach to balance problem requirements and efficient cost evaluation.

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