Hey everyone, I got the results from meta a few weeks ago and wanted to share my experience. Unfortunately, I signed an NDA, so I will not be sharing questions.

JK I'm gonna make sure the community gets what it deserves

Phone Screen:
938. Range Sum of BST
56. Merge Intervals - Variant | Given 2 lists of sorted intervals, merge the two together. I used a two pointer method and the interviewer was satisfied

Onsite:

CODING
199. Binary Tree Right Side View - Variant | Given a binary search tree, print out the left + right side views - Also similar to Boundary of a Binary Tree but you don't have to print out all leaf nodes, just the left and right view

339. Nested List Weight Sum - Exact same as leetcode

1539. Kth Missing Positive Integer - Variant | Instead of missing positive integer, is was missing number from the lower bound, which was whatever value was at index 0
1060. Missing Element in Sorted Array
Example.
[2, 3, 5, 10] k =3 -> result = 7

378. Kth Smallest in a Sorted Array Interviewer was looking for the optimal solution

System Design

Design a price notification system for Amazon. Assume we do not have access to the Amazon API - This interview felt tough, the interviewer was quiet the whole time and didn't ask any question until the last 5 mins where she bombarded me with questions. She also seemed very stern and was very vague about any questions I definitely think I failed this round.

Behavioral
This interviewer was also pretty stern and kind of intimidating. Asked a lot of questions regarding disagreements, teamwork, and leadership.

Some questions the I remember:

• Tell me about a time you disagreed with a teammate and ended up being wrong
• Tell me about a time you were uncomfortable working with a teammate
• Tell me about a time that where you were unable to make a deadline