Kaggle Session 6 (Traveling Santa Problem)
Published in
1 min readDec 6, 2018
Hi All! This is our last Kaggle Session this quarter! Today we are going to show you how to solve the problem of “Traveling Santa” by using Greedy Algorithms and how to efficiently find the closest neighbor point. As usual, first of all, take a look at our slides!
Now it’s our solution notebook time!
That’s it! DS3 wish you all make it through stressing final week and enjoy your holidays! Merry Christmas and Happy new year! See you next quarter!
