Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1377. Frog Position After T Seconds
On a tree rooted at 1, compute the probability that a frog performing a non‑backtracking random walk—each second uniformly jumping to an unvisited neighbor or staying forever if none—will be at vertex target after t seconds. The core challenge is accounting for branching factors and the time constraint along the unique path from the root to the target (including the case the frog gets stuck at the target).
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid August, 2025
Meta
Senior
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.