Problem intelligence
Count Visited Nodes in a Directed Graph
HARD · 1 companies · Depth-First Search · Dynamic Programming · Graph Theory · Kosaraju's Algorithm · Memoization · Tarjan's SCC Algorithm · Topological Sort
Interview priority
48
medium
Target overlap
0/0
Recency
20
Trend
50
Frequency
100
Company observations
BNY Mellonall100
Why this score
high frequency100
unsolved100
Local progress
unseen