Minimum cost to reach destination station on a linear track

There are N stations on a train route. The train goes from station 0 to N-1. The ticket cost for all pair of stations (i, j) is given where j is greater than i. Find the minimum cost to reach the destination. Moving backward is not allowed.
--------------------

Join our 30-days online course to prepare for coding interviews of companies like Google, Amazon, Facebook, Microsoft, etc.

Course On Coding: http://www.ritambhara.in/big-o/
Course On System Design: http://www.ritambhara.in/system-desig...

We have our office in Greater Noida (India) where we run courses for students to prepare them for placements in Top IT companies. For Placement Preparation and Industrial Training call us.

Call: +91-8377803450
Email: [email protected]

Call us to conduct a workshop in your college campus.

Buy our books and prepare for coding interviews on your own.
https://www.amazon.in/Kamal-Rawat/e/B...

For detailed discussions on Interview Questions visit:
http://www.ritambhara.in/