Oracle | MTS | India | Dec 2020 [Offer]
Summary
I interviewed with Oracle for a Member of Technical Staff (MTS) position as a New Grad in India in December 2020. I successfully navigated through online tests and two interview rounds, securing an offer for the role.
Full Experience
Oracle visited my campus for three profiles, and their recruitment process was standard, starting with an online test and followed by 1-3 rounds of interviews.
The online test was unique, consisting solely of MCQ questions across sections like Aptitude, Coding, and Computer Science (including OS, DBMS, OOPs). Some coding questions involved choosing the correct code for a given output or analyzing flowchart logic. The time constraints were very tight, and I couldn't navigate back to previous questions.
When I was called for the interview, I felt a bit nervous because many others had completed multiple rounds, and I hadn't performed well in a previous interview. However, I managed to regain my confidence. I only had two rounds.
In Round 1 (1hr 10mins), there were two panelists. It began with the standard 'Tell me about yourself,' followed by a discussion on my internship project. The interviewer then delved into OS, asking me to list all types of Scheduling Algorithms and the cons of Round Robin (RR) Scheduling. I wasn't entirely sure about the latter but offered plausible ideas. Next, I was tasked with finding the smallest positive number missing from an unsorted array. I initially proposed a naive approach, after which the interviewer increased the number range and challenged me to solve it in O(n) time and O(1) space. The solution didn't immediately strike me, so he moved on. We then discussed heaps and their internal workings, followed by a detailed conversation on hashmaps, collisions, and collision handling techniques. After these discussions, he returned to the coding question. To my surprise, I managed to come up with the optimized solution, which seemed to impress him. The other interviewer then asked me a very simple Binary Tree question, which I coded on Coderpad. He tried to confuse me with cross-questioning, but I steadily answered. The round concluded with a puzzle, for which I unfortunately gave the wrong answer, realizing it immediately afterward. Finally, I was asked if I had any questions for them.
I was somewhat skeptical about a second call after Round 1, but fortunately, I was called for Round 2 (HR, 10 mins). I believe this round was shortened due to time constraints. The interviewer mentioned having feedback from my previous rounds and asked if I had any questions for him, which were the same ones I asked in the technical round. I was still uncertain about my selection since other candidates had more technical rounds, but I was lucky enough to be selected.
Interview Questions (6)
OS: Scheduling Algorithms & RR Cons
The interviewer asked me to name all the types of Scheduling Algorithms and explain the disadvantages of the Round Robin (RR) Scheduling Algorithm.
Smallest Missing Positive Number in Unsorted Array
I was asked to find the smallest positive number missing from an unsorted array. Initially, I gave a naive approach, but the interviewer increased the range of numbers and asked me to solve it in O(n) time and O(1) space complexity.
Data Structures: Heaps
We had a discussion about what heaps are and how they work.
Data Structures: Hashmaps, Collisions, and Resolution
I was asked about the internal working of hashmaps, how collisions occur, and various methods to handle them. We had a good discussion on these topics.
Simple Binary Tree Question
I was given a very simple question on Binary Trees and asked to code the solution on Coderpad. The interviewer tried to confuse me with cross-questioning about my code, but I steadily answered.
Logical Puzzle
I was asked a puzzle at the end of the interview.
Preparation Tips
My preparation involved several key strategies. I made sure to learn all the puzzles from GeeksforGeeks by heart, as they are frequently asked. I also prioritized studying OOPs and OS concepts, as these were crucial areas. Mock interviews proved incredibly helpful for me to refine my approach and confidence. Additionally, preparing with peers significantly aided my learning process. The most important takeaway was to maintain hope and belief in my preparation, even when the placement process felt intimidating, relying on support from friends and family.