Oracle interview experience Real time questions & tips from candidates to crack your interview
Server Technology Engineer
Oracle
4 rounds | 6 Coding
problems
Rejected
Interview preparation journey
Journey
Started coding 2 years back when I was in 2nd year.
I got to know that to get an internship we have to do some coding type stuff.
I started with basic coding and started with hackerank and gradually increases the difficulty of the problem.
After that I moved to leetcode and firstly I solved problems on the basis of tags first easy then medium then hard.
Do all the standard problem of each topic.
Application story
It was an oncampus oppertunity.
Whole intrerview process was done online on ms teams.
Interviewers were helpful.
Why selected/rejected for the role?
Every thing was fine but in second round I was not able to give the proper explanation of the median in a stream of data
That was a standard question but I didn't prepare for that so my be that was the point.
So always solve the standard questions.
Preparation
Duration: 6 months
Topics: Array , DP , Trees , Stack and Queue , Hashmaps , Greedy , Graph
Tip 1 : Be consistent
Tip 2 : Solve all standard Problems
Tip 3 : Prepare core subjects as well
Application process
Where: Campus
Eligibility: 7.5+ cgpa
Tip 1 : Having at least 1 project in resume
Tip 2 : resume should be one page only strictly
Tip 3 : Put some achievements like you got a good rank in a coding contest help you to stand out
Interview rounds
01
Round
Easy
Online Coding Interview
Duration60 mins
Interview date2 Aug 2022
Coding problem2
It was online and we are giving the test on our laptop.
It was about 5 pm in the evening time.
Every time the Online assesement was more about mcqs type but this time whole round was different.
there were one coding question and 1 api question
1. Longest Subarray With Sum K.
Moderate
30m average time
50% success
0/80
Asked in companies
Ninja and his friend are playing a game of subarrays. They have an array ‘NUMS’ of length ‘N’. Ninja’s friend gives him an arbitrary integer ‘K’ and asks him to find the length of the longest subarray in which the sum of elements is equal to ‘K’.
Ninjas asks for your help to win this game. Find the length of the longest subarray in which the sum of elements is equal to ‘K’.
If there is no subarray whose sum is ‘K’ then you should return 0.
Example:
Input: ‘N’ = 5, ‘K’ = 4, ‘NUMS’ = [ 1, 2, 1, 0, 1 ]
Output: 4
There are two subarrays with sum = 4, [1, 2, 1] and [2, 1, 0, 1]. Hence the length of the longest subarray with sum = 4 is 4.
Problem approach
An efficient solution is while traversing the array, storing sum so far in currsum. Also, maintain the count of different values of currsum in a map. If the value of currsum is equal to the desired sum at any instance increment count of subarrays by one.
The value of currsum exceeds the desired sum by currsum – sum. If this value is removed from currsum then the desired sum can be obtained. From the map, find the number of subarrays previously found having sum equal to currsum-sum. Excluding all those subarrays from the current subarray, gives new subarrays having the desired sum.
So increase count by the number of such subarrays. Note that when currsum is equal to the desired sum then also check the number of subarrays previously having a sum equal to 0. Excluding those subarrays from the current subarray gives new subarrays having the desired sum. Increase the count by the number of subarrays having sum 0 in that case.
2. Technical question
Based on api we have to fetch some data by using api from a site and then we have to perform some operation
Problem approach
I'm not able to recognize the the question as it was a long one
But it was similar to typical api questions that is asked in some online round of the companies
02
Round
Medium
Video Call
Duration57 mins
Interview date4 Aug 2022
Coding problem1
It was early in the morning may be the time was 8:30 am.
It was my first round.
He introduced himself and asked me the same.
He started with my internship.
How was my internship?
How was your experience ?
What was my work ?
More discussion was on my experience and work
1. Check If Linked List Is Palindrome
Easy
15m average time
85% success
0/40
Asked in companies
You are given a Singly Linked List of integers. You have to return true if the linked list is palindrome, else return false.
A Linked List is a palindrome if it reads the same from left to right and from right to left.
Example:
The lists (1 -> 2 -> 1), (3 -> 4 -> 4-> 3), and (1) are palindromes, while the lists (1 -> 2 -> 3) and (3 -> 4) are not.
Problem approach
Follow the steps below to solve the problem:
A simple solution is to use a stack of list nodes. This mainly involves three steps.
Traverse the given list from head to tail and push every visited node to stack.
Traverse the list again. For every visited node, pop a node from the stack and compare data of popped node with the currently visited node.
If all nodes matched, then return true, else false.
03
Round
Hard
Video Call
Duration70 mins
Interview date4 Aug 2022
Coding problem2
It was in the morning may be the time was 11:00 am.
It was my first round.
He introduced himself and asked me the same.
Then Jumped to my project section.
1. Project based questions
Explain your project?
What difficulty you faced while implementing the features?
What improvement can you do in your project?
Why used this particular tech stack why not other?
sql vs nosql?
Problem approach
Tip 1:Always be prepare for such questions.
Tip 2: They are just checking that you have done this project or not.
Tip 3: If you have done this then you can able to give answer.
2. Find Median from Data Stream
Moderate
20m average time
76% success
0/80
Asked in company
The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value and the median is the mean of the two middle values.
Example:
Median for ‘arr’ = [1,2,3,4,5] is 3.
Median for ‘arr’ = [1,2,3,4] is (2+3)/2 = 2.5.
Implement the MedianFinder class:
MedianFinder() initialises the MedianFinder object.
1. Void addNum(int ‘num’) adds the integer ‘num’ from the datastream to the data structure.
2. Double findMedian() returns the median of all elements so far.
Note : Answers within 10^-5 of actual answer will be accepted.
Example:
Input:
5
1 1
1 2
2
1 5
2
Output:
1.5
2
Explanation:
MedianFinder() initialises the MedianFinder object.
Add 1 to the data structure ‘arr’, so arr = [1].
Add 2 to arr, so arr = [1,2]
Find Median of current arr, that is (1+2)/2 = 1.5.
Add 5 to arr, so arr = [1,2,5]
Find Median of current arr, that is 2.0.
Problem approach
If we can sort the data as it appears, we can easily locate the median element. Insertion Sort is one such online algorithm that sorts the data appeared so far. At any instance of sorting, say after sorting i-th element, the first i elements of the array are sorted. The insertion sort doesn’t depend on future data to sort data input till that point. In other words, insertion sort considers data sorted so far while inserting the next element. This is the key part of insertion sort that makes it an online algorithm.
However, insertion sort takes O(n2) time to sort n elements. Perhaps we can use binary search on insertion sort to find the location of the next element in O(log n) time. Yet, we can’t do data movement in O(log n) time. No matter how efficient the implementation is, it takes polynomial time in case of insertion sort.
we can use a max heap on the left side to represent elements that are less than effective median, and a min-heap on the right side to represent elements that are greater than effective median.
After processing an incoming element, the number of elements in heaps differs utmost by 1 element. When both heaps contain the same number of elements, we pick the average of heaps root data as effective median. When the heaps are not balanced, we select effective median from the root of the heap containing more elements.
04
Round
Medium
HR Round
Duration20 mins
Interview date4 Aug 2022
Coding problem1
It was early in the evening time may be 4:00pm
It was my first round.
He introduced himself and asked me the same.
1. Basic HR questions
Why you want to join Oracle?
Why I didn't got PPO from my internship?
If you are the manager of a team and one person is taking all the credit. Then what will you do?
Problem approach
Tip 1:Always do some research about the company
Tip 2:These are standard HR questions prepare from the site.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Server Technology Engineer
2 rounds | 3 problems
Interviewed by Oracle
Selected 
1998 views
0 comments
0 upvotes
Associate Consultant
3 rounds | 3 problems
Interviewed by Oracle
Selected 939 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Oracle
Selected 1102 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
Rejected
1727 views
0 comments
0 upvotes