Hello coders, I had my phone screen for meta yesterday and I got asked the following 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 range of the exponent and multiplying 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 depth of tree non-recursively so mentioned while loop until you hit the root of the tree but interviewer did not seem to like that answer.

Good luck!