A greedy Activity selection-esque Question
Shikri and his friend want to go from berlin to china, there are n train stations on the
way. After each stop shikri must buy his friend a sandwich, he does not like this plan, so
shikri wants to take a certain selection of trains to minimize the total number of stops.
Write a pseudocode for a most efficient algorithm to minimize the number of stops, analyze
your running time.

I tried drawing the problem and thought it’s a shortest path problem but I do not know