Number of Ways to Arrive at Destination | Problem of the Day : 16/09/22 | Yash Dwivedi

preview_player
Показать описание


Daily solutions are also uploaded exclusively on our channel! So start solving today and subscribe to our channel for the free coding lessons.


-----------------------------------------------------------------------------------------

Follow us and stay updated on everything happening in the world of geeks:

#GFGPractice #GeeksforGeeks #PracticeProblems #CodingQuestions
Рекомендации по теме
Комментарии
Автор

At the 6:23, it will be d[curr] + wt <= d[v] because if curr dist + wt <= dist v then only it makes sense to update

shreyasvishwakarma