reachability Interview Questions

This interview challenge, recently reported at Glean, explores navigation through a timed transit network. Candidates must determine whether a traveler can successfully commute from an origin point to a destination by catching connecting services under strict scheduling constraints. This task evaluates graph traversal techniques and temporal pathfinding abilities. The complete problem statement and optimal programmatic strategy require a subscription to view.

This graph traversal challenge, frequently featured in Google interview loops, asks you to determine the maximum number of explosive devices you can detonate through cascading chain reactions starting from a single initial choice. Each device features a unique coordinate and blast radius that can trigger neighboring ordnance within range. The puzzle evaluates your graph modeling skills, breadth-first or depth-first search strategies, and geometric distance calculations. Access to the comprehensive problem statement, performance constraints, and complete model solution requires an active subscription.

This Figma interview question evaluates your graph traversal skills by requiring you to handle multiple reachability queries under varying conditions, such as directed links, undirected connections, and dynamically blocked pathways. Testing your proficiency with advanced search algorithms and data structure updates, this problem assesses how well you adapt traversal logic on the fly. Access to the comprehensive problem breakdown and optimal model solution requires a subscription.

This graph traversal and memory management puzzle, featured in Anduril interviews, requires you to identify unreachable heap objects given an initial set of active stack references. You will analyze reference relationships between objects to perform garbage collection style reachability analysis and return all dead objects. Gain access to the full problem statement and optimal solution code with a subscription.