Find Eventual Safe States | Leetcode 802

[@kanirudh6820]

Actually i watched several videos but recently i noticed that always your way of explaining makes me understand things .Not everyone's cup of tea .Keep going bro🔥🔥

[@techdose4u]

🙏🏼

[@theseshadesgucci9354]

nice explanation with illustrations ! keep up the good work man really appreciated

[@techdose4u]

thanks

[@pavanpandya9080]

Great Explanation.

[@techdose4u]

Thanks

[@allwell8570]

Best Explanation

[@techdose4u]

🙏🏼

[@tejaschavan007]

Grate Explanation💥

[@techdose4u]

welcome

[@YuelaiSu]

Good explanation

[@techdose4u]

Thanks and welcome

[@divypareek8230]

Great explanation sir

[@techdose4u]

thanks

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

welcome

[@Anikait-h3d]

it was difficult. had to see video multiple times. i still couldnt undertand why we are doing and operation on isSafe ,checkSafeState ans

[@techdose4u]

to optimise runtime.
sane result of a node like in DP

[@Marvel9-j4d]

Today you uploaded late . 😢

[@techdose4u]

prediction of question dint work :)

[@gypsygirlkigypsylife]

can u detect the error
class Solution {

public:
vectorsafe_node;
bool dfs(vector& graph,vector&visited,int i){
visited[i]=1;
bool is_safe=false;
for(int neigh:graph[i]){
if(visited[neigh]==0){
is_safe&=dfs(graph,visited,neigh);
}
else if(visited[neigh]==1){//cycle
return safe_node[i]=false;
}
else if(visited[neigh]==2){//already computed
is_safe&=safe_node[neigh];
}
}
visited[i]=2;
return safe_node[i]=is_safe;
}
vector eventualSafeNodes(vector& graph) {
int n=graph.size();
safe_node=vector(n,true);
vectorvisited(n,0);
for(int i=0;i