[ INFO ]category: Behavioral · Phone Screen difficulty: medium freq: first seen: 2023-12-12
[MEDIUM][PHONE SCREEN]Phone ScreenInternUnknown
$catproblem.md
I completed a mock interview and a screening interview.
Mock Interview Questions:
Move Zeroes
3Sum
Screening Interview Questions:
A question similar to Diagonal Traverse II. The interviewer requested printing matrix diagonal elements in the following format:
1
2 4
3 5 7
6 8
9
Top K Frequent Elements. While a seemingly straightforward problem solvable with O(n log n) time complexity using sorting, the interviewer prompted for optimization. Using a heap achieves O(k log n), and further optimization to O(n) is possible using quickselect on a hashmap storing frequency counts.
This was my first coding interview experience. While I didn't perform as well as I hoped, I am confident in improving. I wish future candidates good luck.