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

Two City Scheduling

Explore how to apply greedy algorithms to solve the Two City Scheduling problem. Understand the cost optimization to invite half the candidates to each city while minimizing total expenses. This lesson guides you through evaluating and implementing the solution in Go.

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