LeetCode Experience · Jul 2020

Facebook onsite E5 infrastructure

9 upvotes 2,480 views 9 replies

Interview Experience

Round1: coding a) b) lowest common ancestor for n-ary tree with parent pointers Round2: coding. a) b) Longest string without repeating characters (Had more time, so extension asked:...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Binary Search Strings Heap