maximum sum path in a 2d matrix with the following conditions:--
1.one has to start with the left most column but any row.
2.it can move right, up or down.
3.once a cell has been visited it cannot be visited again.
i just need the logic with algorithm please.
As a toddler when I looked at my fingers and wondered,
you helped me to count numbers.
As a kid when I looked at stars with awe,
you helped me and told that's infinity.
As a teen when my confused mind often went blank,
you told that's zero and eventually
vinotha
Mathematics is one word which is useful in every bits of our life,whether we have to put one step or to think anything.