Meta E5 Menlo Park

Phone Screen:

• Q1: Moving Average from Data Stream
• Q2: LRU Cache

Onsite:

Behavioral: The usual questions were asked.

Coding 1:

1. Count of the number of occurrences of a target element in a sorted array - similar to Find First and Last Position of Element in Sorted Array Discussed an initial brute force O(N) time solution and then the optimal O(log N) time and O(1) space solution, coded it, and performed a dry run.

2. Palindrome Linked List Discussed an initial brute force solution using a stack - O(N) time and O(N) space. Then the optimal O(N) time and O(1) space solution was discussed, coded, and a dry run was performed.

The interviewer was really fixated on a lot of details for both questions and had a hard time communicating. So it was difficult figuring out what they were repeatedly asking for. Nevertheless, I solved both questions with optimal working solutions.

Coding 2:

1. Minimum Remove to Make Valid Parentheses
2. Find local minima (similar to Find Peak Element) Discussed an initial brute force O(N) time and O(1) space solution. Then the optimal O(log N) time and O(1) space solution using binary search was discussed, coded, and a dry run was performed.

This was a fun conversational interview, and the interviewer was very personable. He seemed very happy with both my solutions.

System Design: Design Facebook Newsfeed

The interviewer was a little passive but seemed to like my approach to all the specific questions he asked.

Waiting to hear back from the recruiter. I will update the post once I hear back. I am unsure how long it takes to hear back after an onsite interview at Meta?