Challenge #242: Meet Me Halfway

[KaneG]

I couldn't decide which way I wanted to go and so I went with a couple.

Spoiler

The first one finds the centroid for each region and then finds the nearest office to that. This is quick, but does it definitely minimise distance? So the second one actually does the calcs on the distance to work out the min. 

[TonyA]

Here's my solution. Kudos to @Jonathan-Sherman! I started down the same path but ran into a snag

Spoiler

Couldn't figure out how to create the centroid. Kept looking at the spatial tools and forgot all about Summarize. That's what's so great about these challenges. I'm always learning something new..

[Jean-Balteryx]

Here is my solution !

[Qiu]

Very much fun one!

Spoiler

[JennyMartin]

Spoiler

Always fun to use the spatial tools! Video solution here: https://www.youtube.com/watch?v=o2yVymR0ERo&list=PL18SpOXDj-KMUD4YwWC5vZaUsIa7drxNZ&index=46

[Greg_Murray]

This was a fun one. 

[cgoodman3]

Longer than some solutions, but feel this is robust incase the data changes to always find the nearest, instead of incorrectly matching to a nearby location in a different region.

Spoiler

[balajilolla]

Spoiler

Solution Attached

[ACW]

Learned something new, group by region and create centroid, that reduced the steps needed to knock out the task. thx!

[Nanoq]

Im looking forward to seeing some other replies to this, i dont think my solution scales particularly well