Meta Software Engineer Interview: Tackling Tough Coding Challenges and Insights

Software Engineering
, , ,
1

Meta | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Fail
Difficulty: Average

Interview Process

The interview consisted of two coding rounds, one behavioral round, and one design round.

  • First Coding Round: Conducted by a Chinese interviewer with another Chinese shadow. The first question involved calculating the product sum of two sparse arrays, which was discussed and implemented. The second question was a BFS problem that was quickly solved. Feedback from this round was positive.

  • Behavioral Round: Conducted by a white interviewer with an Indian shadow. The discussion was pleasant, and the feedback was also good.

  • Second Coding Round: Conducted by an Indian interviewer who seemed unhappy. The first question was about finding the maximum consecutive 1s by flipping k 0s. Initially, the candidate wrote the correct code but misinterpreted it during a dry run, leading to modifications based on the interviewer’s guidance. After 20 minutes, the interviewer was satisfied and moved on to the second question. The second question was about finding the maximum path sum in a binary tree, which was solved quickly. However, the interviewer had concerns about the candidate’s code, prompting multiple dry runs with different test cases before concluding that the code was correct. The feedback indicated that the first question’s code was somewhat repetitive.

  • Design Round: The design question was related to a system similar to Ticketmaster. This round did not go well, with feedback indicating a lack of consideration for scalability.

The recruiter was very helpful, assisting in gathering internal references and following up on them. Due to the poor performance in the design round, the recruiter attempted to advocate for an E4 position, but the second coding round feedback was not strong enough. The recruiter also provided detailed feedback on the performance.

Technical Questions

  1. Product Sum of Two Sparse Arrays (Array, Hash Table, Sparse Array)
  2. Max Consecutive 1s by Flipping K 0s (Array, Sliding Window, Two Pointer)
  3. Max Path Sum in a Binary Tree (Binary Tree, Recursion, Dynamic Programming)

Tips & Insights

  • Focus on improving code efficiency and reducing repetitiveness.
  • Pay close attention to scalability in design interviews.