LCA of deepest leaves
Given a binary tree as a level-order array `arr` (null for missing), return the value of the lowest common ancestor of all the DEEPEST leaves (the leaves at maximum depth). If there is a single deepest leaf, it is its own answer. The tree is non-empty with distinct values. `1 <= node count <= 10000`.
Implement
lca_deepest_leaves(arr: list[int]) → intExamples
in
[[3,5,1,6,2,0,8,null,null,7,4]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[3,5,1,6,2,0,8,null,null,7,4]]2not run yetsample