Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/randhir200/neelam-s-journey

Neelam has N friendsstudying in various schools. She wants to find a new friend in(N+1)th school. Assume all schools are separated by 1 unit distance. To reach(N+1)th school she has to board a bus. The ith school would cost ofC[i]rupees to travel 1 unit of distance. In other words, the bus fare to travel from the ith school to the jth school isabs(i – j ) * C[i]rupees. The task is to find the minimum bus fare to travel from school 1 to school(N + 1)i.e. beyond the last school.
https://github.com/randhir200/neelam-s-journey

Last synced: 1 day ago
JSON representation

Neelam has N friendsstudying in various schools. She wants to find a new friend in(N+1)th school. Assume all schools are separated by 1 unit distance. To reach(N+1)th school she has to board a bus. The ith school would cost ofC[i]rupees to travel 1 unit of distance. In other words, the bus fare to travel from the ith school to the jth school isabs(i – j ) * C[i]rupees. The task is to find the minimum bus fare to travel from school 1 to school(N + 1)i.e. beyond the last school.

Awesome Lists containing this project