Open In App
Related Articles

Oracle Interview Experience | Set 60

Improve Article
Save Article
Like Article

Online assessment- MCQ Round: (Duration ~ 2hrs)

There were around 4 sections each of which were further divided into subsections:-

  1. Aptitude Contained quantitative aptitude, logical reasoning, flowchart based questions.
  2. Contextual communication- Consisted of grammar correction, reordering of sentences, reading comprehension, vocabulary, word replacements etc.
  3. Data Structures based question there were two 15min subsections.Most of all questions (except maybe 1-2) where based on trees (AVL,  BST). They were output based questions based on insertion/deletion and traversal of these trees.
  4. General Computer Science- questions from OS, DBMS, C++ output with emphasis on declaration of variables question

Time management is key. Accuracy and speed both are important to crack this round. The questions weren’t the regular question  you would find for any other aptitude test. Y After this round 53 students were shortlisted.

Online Coding Round        (1 hr)

  1. Given an array of integers we had to find the length of the shortest possible subsequence of integers that were not in order. A set of integers are said to be in order if they are (non-decreasing or non-increasing).
    Input: 6

Output: 0        (since input is non-decreasing)

Input:  5

Output: 3

  1. You are given n cities: x1, x2,…… xn . Associated with each city is T[i] treasure and C[i] color.
  1. You can choose to visit a city or skip it but you can’t move backwards.
  2. When you visit a city you receive the following amount:
  1. A*T[i]        if the color of visited city is the same as color of previously visited city.
  2. B*T[i]        if this is the first city you’ve visited or if the color of the visited city is different from the color of the previously visited city.

We have to print the maximum achievable profit.

Note: The values of T[i], A, B may be negative. And the range of C[i] is 1 to n.

This was not an elimination round. However a few students were asked about their code during the first interview (I was not one of them and I am glad, since I did not perform very well on the test)

Interview Round 1 (30 min)

My interviewer was extremely sweet. He told me that he was going to ask the same questions that were asked to him during his placement:

  1. Given an integer array, its size and a number (target sum) as function parameters. I had to return all possible pairs of integers that add up to the target sum. Note: the array is sorted.
    Eg: Array: {1,3,4,5,7,9}        Target sum: 8

Output: (1,7),(3,5)
Expected Complexity : O(n)

Note that he was extremely particular about how the output must be stored in an array and then printed later rather than the practise that we generally follow, that is to print the output directly.

  1. Function parameters are n and an array of size n-1. All elements in the array are in the range 1 to n. However one number is missing. The function had to return that number.

Eg: n=6                Array:  {2,1,4,6,3}

Output: 5

  1. Next , he gave me a puzzle :

        Assume that we have a bag of marbles and there is a 100 storey building. When we drop the marble from the kth floor it breaks such that from 0 to k-1th floor the marble does not break and from k to 100th floor, the marble will break. Once a marble has been dropped, it can’t be retrieved. What will the maximum number of marbles required to identify that floor.

I took 2 minutes to ponder about it and suggested a solution on the lines of binary search and answered 7 (log2 100 = 7)

He was happy with my approach. I asked if there was a better approach, he said that he likes my approach.

 At last, he asked if I had any questions for him to which i asked, how is it to work at Oracle to which he replied, “I feel at college!”

Interview Round 2 (45 min)

First of all the panelist that I was assigned had interviewed the previous candidate for over 1hr 45 mins and I was extremely intimidated. I was called for the interview and we exchanged greetings. He said he did not get them time to go through my resume and if I could brief him about it. I  mentioned that one of my projects is hosted on the web and asked me the URL and checked it out.

Then he flipped through my previous scratch sheets and asked about the questions I was asked in the previous round. Then we proceeded with questions :

  1. Given a string S which had many characters, special characters but no parenthesis in the first few places followed by a parenthesis and many nested parenthesis within it followed by other parenthesis, I had to retrieve the data within the first block of parenthesis

        S = ……….(…(…(..)(…))….)(…)

                  *                *

        The output must be the data i have indicated within the asterix

I wrote a function for this and he was satisfied with my approach. I asked him if he has any feedback on my code to which he suggested one or two points

  1.  Next he asked me puzzle :

There are n birds and m trees. If 2 birds sit on each tree, there remains one tree with no birds. If      1 bird sits on each tree, there remains a bird with no tree to sit on. Form the equations to find m and n.

  1. Then  he asked me to sort an array in descending order. I asked what algorithm must be used to which he answered I must use any algorithm which I can code flawlessly since he doesn’t care about the complexity right now and not pick up an algorithm to impress him. Of course, I picked the easiest one, Selection sort. Then he asked me to search an element in it  for which i used modified Binary search since my array was already in decreasing order

Interview Round 3 (45 mins)

The interviewer made me comfortable and asked if I was tired, etc. Then a few ice breaker questions like tell me about yourself.

  1. He asked me to sort a circular linked list in increasing order using only inplace operations. I was a little confused but he helped me make my way through it. I discussed my thoughts with him constantly and finally reached the desired solution.
  2. I was asked to design a valet parking system and represent a class diagram. Agai, we discussed the approach (the entities, their attributes, their behaviours , relationships and triggers) and I was able to give him what he was looking for.

Though I was not very happy about my performance in this round but the interviewer made sure I felt comfortable and also told that he liked how I was vocal during the process and moved in the right direction with subtle hints.

Interview Round 4 – HR (10mins)

The questions were pretty generic :

  1. How was your interview experience so far?
  2. Tell me about yourself, your family background?
  3. Location constraints?
  1. Why Oracle?
  2. How were my previous internship experiences?
  3. What is your one quality that everyone who knows you well shall vouch for?
  4. What do you expect from Oracle?
  5. Do you have any questions for me?

At last, while signing off, I gave her a firm handshake and said, hope to see you soon at the Oracle office, to which she gave me big smile!

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 02 Sep, 2017
Like Article
Save Article
Similar Reads