Giving back to community Question 1: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/description/ First gave O(n) solution but E wanted me to optimize. Then gave O(1) solution Follow-up: "How can you prove that the O(1) solution would converge?" I fumbled...

LeetCode Experience · Jun 2024

Meta Phone Screen MLE E5

MLE Phone Screen Senior

1 upvote 501 views 6 replies

Interview Experience

Giving back to community Question 1: First gave O(n) solution but E wanted me to optimize. Then gave O(1) solution Follow-up: "How can you prove that the O(1) solution would converge?" I fumbled...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Strings Two Pointers

← All Meta questions Meta Machine Learning Questions → All Binary Tree Questions →

Meta Phone Screen MLE E5

Interview Experience

Full Details

Topics

More from Meta