So I heard this algorithm question today. So you have a truck that is moving around a circular track with gas stations spaced out at some distance between them. Each station has a finite amount of gas, the distance between the gas stations requires a certain amount of gas to traverse and you can only move in one direction. What is the algorithm to use, which gas station to start, so that you can move around the whole gas station?
I think this question is common, I might have missed some details, so anyone feel free to add in.