
Synthesized from 24 candidate submissions for ALL.
The candidate successfully completed the phone screen for an E4 role at Meta. The process was challenging but fair, focusing on algorithmic efficiency and technical reasoning.
The phone screen consisted of a brief introduction, followed by two coding problems, and concluded with a Q&A session. The interviewer focused on time and space complexity, solution tradeoffs, and edge case identification.
Binary Tree Right Side View
Max Consecutive Ones III variation involving holidays and work days
The candidate prepared for five months, balancing full-time work and personal commitments. Despite expecting rejection due to perceived poor performance in system design and one coding round, they received an offer for the E4/L4 level at Meta. The candidate emphasizes hard work and luck in the interview process.
Recruiter initiated an informal chat to understand the candidate's background and preferences.
A 45-minute technical phone screen was conducted, focusing on coding problems.
Parentheses-related problem (Facebook tag questions)
Palindrome-related problem (Facebook tag questions)
Follow-up: Explanation of approach for a hard palindrome problem (no coding required)
A coding round with two problems focused on array manipulation and tree algorithms.
Subarray sum equals K (two scenarios: input with all positive numbers and input with negative numbers)
Lowest Common Ancestor problem (two instances)
A coding round with two problems focused on array manipulation and linked lists.
Merge K Sorted Arrays (LeetCode uses 'list', but the question used 'array')
A system design round similar to designing a ticketing system but less complicated.
Behavioral questions were prepared using online resources and sample answers from specific channels.