search

SarthakKeshari / CPP-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
47 stars 132 forks source link

Minimum cost to reach the destination. #376

Closed PrakharRathore123 closed 2 years ago

PrakharRathore123 commented 2 years ago

Enter your question -

Given a cost matrix cost[][] and a position (m, n) in cost[][], write a function that returns cost of minimum cost path to reach (m, n) from (0, 0). Each cell of the matrix represents a cost to traverse through that cell. The total cost of a path to reach (m, n) is the sum of all the costs on that path.

Enter link to the question(if question belongs to any online platform) -

-

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion , Matrix ,Dynamic programming.

PrakharRathore123 commented 2 years ago

@SarthakKeshari Kindly assign me this issue.

SarthakKeshari commented 2 years ago

@PrakharRathore123, Kindly add your solution to "Dynamic Programming" folder Deadline - 09/10/2021