Meta Tech Screen
Summary
I had a tech screen at Meta where the interviewer guided me through two coding problems. While I initially struggled with the problems, I was able to suggest the correct approach for the first one. I'm currently unsure about the outcome due to the significant help I received.
Full Experience
My recent tech screen at Meta was quite an experience. The interviewer was incredibly supportive, guiding me throughout the session. Even though I had prepared extensively with the top 70-75 LeetCode questions, the problems presented were distinct. I initially explored a few approaches that didn't quite work out, but for the first question, I eventually proposed the correct strategy, which involved using prefix sums. The second question was also unique, not following the typical patterns of problems like 2sum or 3sum. Overall, I received a fair bit of assistance from the interviewer, leaving me uncertain about the final outcome, as I understand that naive solutions are generally not sufficient.
Interview Questions (2)
Given an array, return an index for which the sum of the elements to its left is equal to the sum of the elements to its right. For example, in [2,3,4,5], the index 2 is the answer because arr[0]+arr[1] (which is 2+3=5) equals arr[3] (which is 5).
Given an array, find the maximum of two numbers in the array such that these two numbers are not adjacent.
Preparation Tips
I prepared for the interview by studying the top 70-75 LeetCode questions.