I took the Mock Interview On 104-Dec-2023
Following two questions were asked
1)https://leetcode.com/problems/move-zeroes/
2)https://leetcode.com/problems/3sum/
I took the Screening on 11-Dec--2023 follwoing two questions were asked:
- https://leetcode.com/problems/diagonal-traverse-ii/ - Not exact one but very simllar to this, The Interviewer asked me to print the matrix diagonal element in below fashion
1
2 4
3 5 7
6 8
9
- https://leetcode.com/problems/top-k-frequent-elements/ : This looks easy but, by default we go with sorting and Time Complexity of O(nlogn), then we get asked to improve it, if we use heap we will get to O(klogn), but if we can think of quick select over a heap of on hash which we already calculated the frequency we can do it in O(n)
Good Luck guys, I didnt do well in my interview, This is my first experience with Coding Interview, but I am confident I can do better, thank for all your previous discussions. Wish you all good Luck.