I just finished two rounds of interviews this week Meta SDE VO, the overall rhythm is very standard, but the difficulty is really not high. Coding and question types are very typical. The interviewer is also very communicative. He explains his ideas clearly and basically follows your lead. He will not deliberately make things difficult for you. Each round lasted about 45 minutes, with little to no small talk.
Round 1
BQ:
1. Please share your specific practices and results in optimizing system performance in a project.
2. How would you handle it when you and the product manager disagree on a technical solution?
3. Describe a time when you led a team to solve a technical problem.
T1: Two Sum classic questions
Given an integer array nums and an integer target value target, please find the two integers in the array whose sum is the target value target and return their array subscripts. You cannot use the same element twice, and you are guaranteed to have only one solution.
This idea uses hashMap to store the traversed elements and corresponding indexes. Each time an element is traversed, see if there is a target number that meets the requirements in the hashMap. Everything is done in one pass
T2: Validate Binary Search Tree
Given a binary tree root, determine whether it is a valid BST.
The nature of the binary search tree of this question is that the values of all nodes in the left subtree are less than the root node, and the values of all nodes in the right subtree are greater than the root node. Direct recursion, when verifying the left subtree, pass in the small range and large range of the left subtree value as parameters, and the same is true for the right subtree. Follow up: If Parallel Validation of Large BST is Needed, How to Approach It?
Round 2:
BQ:
1. Describe an actual case in which you proactively identified technical debt and promoted resolution.
2. How do you assess priorities and convince teams to commit resources?
Coding:
The question is given a list of words arranged in dictionary order from an alien language. It is required to infer the order of letters. If the order is inconsistent, an empty string is returned.
Problem-solving ideas: First build a dependency graph between characters, find the first different pair of characters by comparing adjacent words to establish a directed edge, and record the in-degree of each character. Then use topological sorting to perform BFS traversal starting from the node with in-degree 0. Each time a node is processed, the in-degree of its neighbors is reduced, and the newly generated node with in-degree 0 is added to the queue. Finally, it is judged by comparing the number of output characters with the total number of characters.
Meta SDE VO review
The whole session went very smoothly, and I passed smoothly in the end! The interviewer pays close attention to the code integrity and boundary processing. After the basic implementation is written, he will continue to extend the discussion to large-scale data scenarios. The overall sense of communication is very good. It is not a pressuring question, but a step-by-step push to deepen the problem. After chatting, I actually gained a lot.
If you are sprinting for major companies such as Meta, Amazon, Google, Apple, etc., we provide a complete set of job search support solutions - from OA assistance to VO assist , to salary negotiation and onboarding planning at the offer stage, with full-process support. From OA to interview, from interview to contract negotiation, we will escort you all the way until you successfully get your favorite offer.
