Meta London SWE E4 Interview Experience | Pass
- Result
- Offer
- Location
- London
- Posted
- 7 Aug 2024
Summary
I successfully navigated the Meta London SWE E4 recruitment process, which included a mock interview, phone screening, full-loop interviews, and a follow-up, ultimately securing a hire decision.
How it went
My journey through the Meta recruitment process was remarkably smooth, largely thanks to a highly supportive recruiter. After applying on March 17th, I was contacted by the recruiter on April 22nd. We had a mock interview on May 12th where I solved questions like "Move Zeroes" and "Number of Islands". This was followed by a phone screening on May 15th, during which I tackled "Basic Calculator II" and a problem involving merging three sorted arrays without duplicates. I received positive feedback the very next day, May 16th.
The recruiter then set up a call on May 24th to explain the further process. The full-loop interviews took place from June 26th to 27th, comprising two coding rounds, a product design round, and a behavioral round. Unfortunately, I cannot share the exact questions from these rounds due to an NDA. On July 9th, I received an update and was asked for a follow-up coding interview, which I completed on July 30th. This final round also involved two LeetCode Medium questions, though I cannot disclose the specifics. Finally, on August 1st, I received the exciting news of a hire decision.
Questions asked (4)
- 01
Move Zeroes
Data Structures & Algorithms · Easy
Given an integer array
nums, move all0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. - 02
Number of Islands
Data Structures & Algorithms · Medium
Given an
m x n2D binary grid which represents a map of'1's (land) and'0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. - 03
Basic Calculator II
Data Structures & Algorithms · Medium
Given a string
swhich represents an expression, evaluate this expression and return its integer result. The integer division should truncate toward zero. You may assume that the given expression is always valid. All intermediate results will be in the range[-2^31, 2^31 - 1]. - 04
Merge 3 Sorted Arrays (No Duplicates)
Data Structures & Algorithms · Medium
Given three sorted integer arrays, merge them into a single sorted array. The resultant array should not contain any duplicate elements.
How they prepared
For my coding rounds, I meticulously prepared using a list of Meta top 350 questions, which included problems from the Cracking Faang YouTube playlist. I also made sure to keep an eye on the LeetCode discuss section for the latest Meta interview questions. I found great value in the detailed and simple solutions provided by channels like Timothy H Chang, Programming Live with Larry, and NeetCodeIO. For system design, I highly recommend Hello Interview (YouTube) and the hellointerview.com website to prepare. I want to emphasize that this is not a sponsored post.