Panda Guru LogoPanda
Guru

Meta E4 Onsite | Passed

Round 1: Coding Round 1

Questions:

Candidate's Approach
  • For Valid Palindrome II, I considered edge cases involving spaces and punctuation.
  • For All Nodes Distance K in Binary Tree, I defended my approach of creating a new graph for clarity in BFS traversal, despite the interviewer's concerns about duplicating the tree.
Interviewer's Feedback
  • The interviewer seemed unhappy with the decision to create an additional graph object for the left and right nodes, indicating a preference for a more straightforward solution.

Round 2: Coding Round 2

Questions:

Candidate's Approach
  • For Valid Number, I got stuck coding the edge cases but was able to resolve it with hints.
  • For Top K Frequent Elements, I proposed bucketing but struggled with the correct implementation as time ran out.
Interviewer's Feedback
  • The interviewer noted that the approach to make it O(n) constant time was incorrect and indicated that I had chosen the wrong method for bucketing.

Round 3: System Design

Questions:

Candidate's Approach
  • I signed an NDA, so I cannot disclose specifics, but I recommend preparing with mock interviews for system design, which helped me significantly.
Interviewer's Feedback
  • No feedback provided.

Tips