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

Solution: Two City Scheduling

Explore how to use a greedy algorithm to solve the Two City Scheduling problem by minimizing costs while evenly distributing candidates between two locations. Understand sorting based on cost differences and how to assign candidates optimally.

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