Meta phone screen

Round 1

Questions:

1. Find x^n
   Notes: I went straight for the most optimum solution and the interviewer didn't seem to like that, so I had to explain the brute force method of iterating over the range of the exponent and multiplying the number to itself in each iteration. Was asked to explain time and space complexity.

2. LCA of n-ary tree
   Notes: Asked to explain time and space complexity, and if I could find a solution non-recursively. I did not know how to find the depth of the tree non-recursively, so I mentioned a while loop until you hit the root of the tree, but the interviewer did not seem to like that answer.