LeetCode Weekly Contest 240 Question 4: Largest Color Value in a Directed Graph

preview_player
Показать описание
Time Stamp: 1:33:17
Рекомендации по теме
Комментарии
Автор

nice alternative to all other hr long videos

river.
Автор

what if there are two components and one is cyclic and the other is not. Ideally we should be returning the non cyclic longest path. but over here you're not considering that case

notsodope
Автор

Also if there are more than one component then in that case ?

tushar
visit shbcf.ru