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 236. Lowest Common Ancestor of a Binary Tree

Given a binary tree and two nodes p and q, find their lowest common ancestor — the deepest node that has both p and q as descendants (a node can be a descendant of itself). The tree can be large (up to 2e5 nodes), nodes are unique and p and q are guaranteed to exist.

Asked at:

Meta

Canva

Amazon

Atlassian

Question Timeline

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

Company

Level

Region

Mid November, 2025

Meta

Principal

Early October, 2025

Meta

Mid-level

Late September, 2025

Meta

Mid-level

Get Premium to View All 40+ Reports

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 236. Lowest Common Ancestor of a Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact