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

Two City Scheduling

Explore how to apply greedy algorithms to minimize the total cost of scheduling candidates evenly across two cities. Learn to analyze cost differences and implement a strategy that ensures half the candidates go to each city. This lesson helps develop problem-solving skills for cost optimization challenges in coding interviews.

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