Available question text
Given a tree of N outposts (2 ≤ N ≤ 7×10⁴) connected by N-1 bidirectional tunnels where leaf nodes are exits, determine the minimum number of robots starting at exit outposts needed to guarantee catching Sara, who starts at a given outpost K and moves optimally to escape.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Cost Router Placement Among Houses
Practical engineering
- Add Tests and Optimize Duplicate Processing
Practical engineering
- Analyze matrix multiplication complexity
Practical engineering
- At-Least-Once Job Queue with Timeouts, Retries, a Dead-Letter Queue and Dependencies
Practical engineering · Data Structure Design · Job Scheduling & Workflows
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
LinkedIn
Minimum Robots to Capture Sara
Reported Jul 31, 2026 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source