30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 1644. Lowest Common Ancestor of a Binary Tree II

Given a binary tree and two target nodes p and q, return their lowest common ancestor if and only if both targets exist in the tree, otherwise return null. The main challenge is to compute the LCA while simultaneously verifying the presence of p and q during a single traversal (e.g., post-order DFS).

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid December, 2024

Amazon

Mid-level

Find the lowest common ancestor of a binary tree

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1644. Lowest Common Ancestor of a Binary Tree II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact