Hey Everyone. I recently had my oracle interview. Altough I don't really regret being rejected, it is what it is but the interview dynamics weren't pleasing. We were asked to come to the place where the interviews were being held at 9 am and I got my first round at 4 pm, for god's sake. And it was raining badly, even my shoe got torn which meant I couldn't go out to eat all day. Meanwhile, few people had already had their third round of the interview which of sort of frustrating to see.
Anyway, coming back to the interview, first I was asked to explain my project in details, show its schemas and some extra features I can add. I explained one of my MERN project, which easily took 10-15 minutes. The interviewer for from South-India so the entire interview was in English. After the project, we came straight to DSA and I was asked as many as 5 DSA questions, here's the list:
- Zigzag Traversal of a Binary Tree (https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/)
- Sort array with 0, 1 and 2 (https://leetcode.com/problems/sort-colors/description/)
- Spiral Traversal of a Matrix (https://leetcode.com/problems/spiral-matrix/description/)
- Find kth node from the end of Linked List (https://www.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)
- Convert Binary Tree to Doubly Linked List (https://www.geeksforgeeks.org/problems/binary-tree-to-dll/1)
I was able to tell him the first three questions optimally, that is O(n), O(n) and O(n^2) respectively. Although idk why but I precalculated height of the tree in the first one rather than going directly to initalize by answer vector and he wasn't pleased with that. In the fourth question, I literally had no clue how to do it with using any other Data Structure (which is basically a crime in LL questions), so yeah, that might have been an aura -100 moment. To put the cherry on top, I couldn't satisfy him with the fifth question either as I wasn't thourough with Morris Traversal back then, However, I did explain him how I'd do this using recursion but guess he wasn't happy with the approach.
So this is it about my interview experience. Not bummed but I know I could have done better. Do let me know what you guys think about it. Bye bye till then!
Happy Leetcoding,
Naman Singhal