Heyy,
This is the link of the question I was trying to solve. It is similar to min cost path. I am getting wrong answer Please tell the approach/solution
this is my code:
Heyy,
This is the link of the question I was trying to solve. It is similar to min cost path. I am getting wrong answer Please tell the approach/solution
this is my code:
Try this:
yes its working thankyou so much!
can u tell me why my solution is not working?
the question statement is also not very clear
Actually, u need to calculate the minimum of the maximum of all numbers in each path.