Facebook | Phone | Valid Palindrome & Diameter of Binary Tree
Anonymous User
1376

Location: London

I had my phone interview couple of days back.

  1. Valid Palindrome without any temp storage. Ran through the code with the sample inputs given with the problem statement.
  2. Diameter of a Binary Tree : What is the TC and SC [mainly the recursion stack]. Ran through the sample tree given with the problem statement.
  3. Diameter of an N-Ary Tree. Ran through the sample tree given with the problem statement.

I did all in 45 minutes and still get rejected. Actually I am still clueless that why I get rejected. May be GOD is not feeling safe to send me to London due to the high COVID figure [Only Joking Please don't take this part seriously]

The reason for Rejection are : [ My Guess]

  • The interviewer is a c/c++ guy may be , He was very unhappy about the global variable for maxDia in 2nd Solution. He seems okay after I passed it as an Objects instead of a global variable. He didnot liked the concept of using a global variable to track the maximum diameter during the recursion.

  • He was not interested from begining, I found him not at all interested about the interview after it is started. May be he is going through some personal problem during this difficult time. He was just asking questions and I am not found him attached with the process at all.

Comments (6)