Hi fellow leetcoders,

I had a phone screen interview recently for Facebook London.
I had two questions, one easy, one medium.

• Easy question: find the subtree with maximum sum of all its node values in a binary tree.
• Medium question : identical to 1209 (with k set to 2).

Did both in about 40 minutes (10 + 30).

Good luck to all

Update :

• I moved to the next stage :)
• As pointed by KunMan, second question was actually 1047
• I am candidating for level E5 (position is software engineer, machine learning)
• I will try to update you all when I will have passed the onsite