LeetCode Experience

#1123 Lowest Common Ancestor of Deepest Leaves

SWE coding Medium

Interview Experience

LeetCode #1123: Lowest Common Ancestor of Deepest Leaves. Difficulty: Medium. Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Binary Tree Breadth-First Search Depth-First Search Tree Binary Tree Graph Hash Table

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Hash Table,Tree,Dfs,Bfs,Binary Tree Questions →