Question Details
Problem Given a graph, determine which nodes are reachable from a given source node, likely via BFS or DFS traversal. Likely LeetCode equivalent General graph reachability; similar to Number of Connected Components (LC 323) or Find the Town Judge var…
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Coding
Onsite
Phone
More from Robinhood
Reddit
Robinhood SWE Interview
Reddit
Robinhood mobile SWE interview experience
1p3a
Robinhood Frontend Engineering Onsite Interview Experience and Challenges
1p3a
Robinhood Fulltime SDE Technical Phone Screen Interview Experience
1p3a
Robinhood software engineer coding interview on fractional shares inventory