Algo Talk: Railroads from Facebook Hacker Cup
Errichto Algorithms · 27:08
The problem is "Railroad Reconstruction" from Facebook Hacker Cup Round 3. It can be solved in roughly O(n³) or O(n³ log n) with dynamic programming. The trick is to see that moving an observation in time only helps i...