Panda Guru LogoPanda
Guru

Meta E5 | Phone Screen

Round 1

Questions:

  1. kth largest element in an array. (Quickselect expected)
    • I got away with it by saying that I am not sure if I will be able to code the entire partition function. However, we discussed the time complexity in average and worst case. I coded heapsort solution.
  2. Basic Calculator - ii
Candidate's Approach

For the kth largest element, I discussed the Quickselect algorithm but opted to implement a heapsort solution instead. We also covered the time complexities for both average and worst cases.

Interviewer's Feedback

No feedback provided.