Unique Paths II and Lowest Common Ancestor
Filed under Media.net
The question
Solve two medium-level problems within 60 minutes: find the number of unique paths in a grid with obstacles using dynamic programming, and find the lowest common ancestor of a binary tree.
No write-up yet. Related questions below have one.
Related Media.net questions
Collected from public candidate posts and coding forums. Updated Nov 2026.