Meta Infra US Screening
- Location
- US
- Posted
- 5 May 2025
339 reads
Summary
I had a screening interview with Meta today. I was asked one behavioral question and two coding questions, one being a variant of Random Pick with Weight and the other Lowest Common Ancestor of a Binary Tree. I'm unsure about the outcome as I ran out of time on one coding question.
How it went
Screening interview happened today, not sure if I stand a chance.
Behavioral question
- Explain in depth a conflict situation while collaborating with another team, steps taken and conclusion.
Coding questions
- Variant of https://leetcode.com/problems/random-pick-with-weight - This one I coded fine.
- As it is https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ - This one I explained everythng and ran out of time finishing the recursion exit conditions (missed 2 out of 4).
Hope this helps!
Questions asked (3)
- 01
Conflict Resolution with Another Team
Behavioral
Explain in depth a conflict situation while collaborating with another team, steps taken and conclusion.
- 02
Random Pick with Weight (Variant)
Data Structures & Algorithms
Open the problemA variant of the problem described at https://leetcode.com/problems/random-pick-with-weight.
- 03
Lowest Common Ancestor of a Binary Tree
Data Structures & Algorithms
Open the problemThe problem as described at https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/.