I just helped a student to finish Meta VO's interview review, the pace is still as tight as ever, the time control is strict, every question has to be quickly understood and analyzed to give an OPTIONAL solution. The pace is as tight as ever, the time control is strict, each question has to be quickly understood, analyzed and given an optional solution, but this student in our help, the whole process is very smooth, let's look at the process together!
Meta VO 1st round
Similar to the regular CS Coding VO process, it starts with introducing themselves to each other. Then the BQ session about the resume starts with the following questions:
- Tell me about a complex project you have participated in.How did you resolve the technical challenges within it?
- How did you deal with the tight deadlines?
- Tell me about most biggest mistake you made and what did you learn from it.
Tips: When preparing for Meta's BQ, gain a deep understanding of and uphold Meta's five core values and reflect the company's culture in your answers, as well as use the STAR model to organize your responses, pick your own true story, and mock your presentation in advance to see if it is natural and fluent.
Coding
1. The question is to find the longest common prefix. You are given a bunch of strings and then you have to find the longest common prefix at the beginning of each of them.
2. The question asks to determine if s is a subsequence of t. You are given two strings s and t and asked to determine if s is a subsequence of t. Subsequent sequence means that you can pick some characters from t in order (which can be discontinuous) and spell s, but the order of the characters must not be messed up.
Follow up: If you have hundreds of millions of s's to determine if they are subsequences of t (e.g. S1,S2.... .Sk,k is very large), how do you optimize your code to make each determination faster.
Meta VO 2nd round
The second round of BQs was to tell about an experience of dealing with an ambiguous situation and how it was overcome to achieve a positive outcome and to tell about an experience of helping a peer.
Coding (2 courses, medium difficulty)
- The first one is a nested array question, the key information of Clarify is whether the depth is from the first row, you need to pay attention to the boundary condition that is empty. The first question is about nested arrays. recursion is used, and a dfs with depth is nested in the main function. dfs traverses the list by checking the elements in the list one by one, and then code+ dry run, which adds up to about ten minutes.
- The second was sliding widow, a variant of executive1, and the explanation of the idea was quite clear, no big problem.
Meta VO 3rd round
The third round of the BQ is about a major challenge at work and the most challenging aspect of a project, which should be described honestly, with an emphasis on problem-solving and teamwork, the role you played, and the successes you achieved through your personal efforts.
Coding (biased OOD)
- LRU Cache Full Design Implementation (Includes O(1) Operations)
- Discuss the extended version:How to implement a thread-safe caching system at high concurrency
Problem Solving Ideas:
- At the beginning I use hash table to realize O(1) lookup, with two-way chain table to maintain the access order. Then the get operation is performed through the hash table to locate the node and move to the head of the chain table; for the put operation, first check whether the key exists, if it exists, update and move the node, if it does not exist, create a new node inserted into the head, and finally, check the capacity, overcapacity, eliminating the tail node.
- When designing a highly concurrent thread-safe cache system, I first used read and write locks, shared locks for read operations to support concurrent access, and then reduced contention through segmented locks, replication on writes to achieve lock-free reads, asynchronous queues to handle write requests, and finally integrated functions such as expiration cleanup and monitoring statistics.
How to get through an interview at Mata fast?
Feeling stressed about preparing for Meta ? Get ProgramHelp to help you out! We provide a full range of coaching for Meta interviews from tutoring to actual combat, with a rich knowledge base and strong problem solving ability, to help you interview less detours, fast pass, easy to take the Offer, if you also need VO Interview Helper, Interview Assistance, Interview on behalf of the interview and other services, please contact us.
