{"status":true,"key":"02066974135219809115","created":"2026-11-06T10:04:52.791Z","expire":"2026-11-20T10:04:52.791Z","title":"Roo Hastebin","data":"# LC3515: Shortest Path in a Weighted Tree Queries II\n\nInterview notes (binary lifting LCA). Clarify input bounds, then outline the optimal approach and walk one example.\n\nPractice similar problems with [Linkjob.ai](https://www.linkjob.ai/).\n\n## Approach sketch\n- Restate the problem and constraints\n- State time/space before coding\n- Handle edge cases explicitly\n"}