LeetCode
Question
·
Feb 2020
·
Los Angeles
Google Interview | L3/L4 | Jan 2020 (Reject)
2 upvotes
1,612 views
7 replies
Question Details
2 YOE Completing my Masters Phone Round: Fairly straight forward - getting diameter in a tree and a follow up - how I would approach for N-tree OnSite (4 Coding + 1 Behavior) Round...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
Binary Tree
Heap
Queue
Stack