Panda Guru LogoPanda
Guru

Meta Phone Screen E4

Round 1

Questions:

  1. Traverse characters in a 2D array in reverse diagonal. Variant of 490.
  2. Check if a binary tree is complete. 598.
Candidate's Approach
  • Solved Q1 easily.
  • For Q2, initially struggled with the parent and children ID relation and used the column number for all levels.
  • Verified the solution with an increasing sequence and level size.
  • Acknowledged that the approach works but could be optimized to O(n) instead of k log n.
Interviewer's Feedback

No feedback provided.