search

Mozilla-Campus-Club-Cummins / HacktoberFest23_MozillaCCEW

0 stars 0 forks source link

Minimum Cost Path #95

Open sanskritisri13 opened 1 year ago

sanskritisri13 commented 1 year ago

Given a square grid of size N, each cell of which contains integer cost which represents a cost to traverse through that cell, we need to find a path from top left cell to bottom right cell by which the total cost incurred is minimum. From the cell (i,j) we can go (i,j-1), (i, j+1), (i-1, j), (i+1, j).

Note: It is assumed that negative cost cycles do not exist in the input matrix.

akanksha1131 commented 1 year ago

Can you please assign this to me? Akanksha Kale Cummins TY IT UEC2021139

bargeshreeya commented 1 year ago

I would like to work on this issue Shreeya Barge UIT2021810 TY IT

sanskritisri13 commented 1 year ago

Yes I will be assigning you the issue by the end of the day. Thank you!

On Sat, 21 Oct, 2023, 09:27 bargeshreeya, @.***> wrote:

I would like to work on this issue Shreeya Barge UIT2021810 TY IT

— Reply to this email directly, view it on GitHub https://github.com/Mozilla-Campus-Club-Cummins/HacktoberFest23_MozillaCCEW/issues/95#issuecomment-1773646964, or unsubscribe https://github.com/notifications/unsubscribe-auth/A4FQQHY6QH3MMA4U2H3GEVLYANB3DAVCNFSM6AAAAAA57L4HLSVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMYTONZTGY2DMOJWGQ . You are receiving this because you authored the thread.Message ID: <Mozilla-Campus-Club-Cummins/HacktoberFest23_MozillaCCEW/issues/95/1773646964 @github.com>