Oracle interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Oracle
3 rounds | 1 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 4 months
Topics: Pointers, Binary tree, Binary Search tree, OOPS, Time Complexity, Algorithms, DBMS
Tip 1 : Practice basic as well as advanced questions on Binary Search Tree and Binary Tree
Tip 2 : Practice on aptitude part also
Tip 3 : If you do not have any project on software development, then think of implementing whatever project you have through coding
Application process
Where: Campus
Eligibility: CGPA : 7 & above and no active backlogs , Online test
Tip 1 : Have some projects on resume whether it is related to software development or not
Tip 2 : One page resume is best and do not put false things on resume
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date27 Aug 2020
Coding problem0
Test included questions based on aptitude, probability, coding MCQs and DBMS MCQs. There was 2 hour window for the test between which a student can login the test. There was web cam monitoring also.
02
Round
Medium
Face to Face
Duration45 minutes
Interview date31 Aug 2020
Coding problem1
At first, there were few questions regarding projects mentioned in resume. Later , few questions were asked from binary tree and binary search tree and in last a puzzle was asked. It lasted around 45 minutes. The interviewer was supporting type.
1. BST to greater tree
Moderate
25m average time
65% success
0/80
Asked in companies
Given a binary tree with 'N' number of nodes, convert it to a Greater Tree such that data of every node of the original BST is changed to the original node’s data plus the sum of all node’s data greater than or equal to the original data of the node in the BST.
A binary search tree (BST) is a binary tree data structure that has the following properties.
• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
Example:
Answer:
Because only 5 is greater than 4 in the above BST, node 4 will be updated to 9 (4 + 5 = 9).
Nodes 3, 4, and 5 are greater than 2, hence node 2 will be modified to 14 (2 + 3 + 4 + 5 = 14).
Node with data 5 will remain the same because there is no node in the BST with data greater than 5.
Nodes 2,3, 4, and 5 are greater than 1, hence node 1 will be modified to 15 (1 + 2 + 3 + 4 + 5 = 15).
Nodes 4 and 5 are greater than 3, hence node 3 will be modified to 12 (3 + 4 + 5 = 12).
03
Round
Medium
HR Round
Duration30 minutes
Interview date31 Aug 2020
Coding problem0
It lasted around 30 minutes and basic HR questions were asked in this round like Why do you want to join us?
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 create a function in JavaScript?
Choose another skill to practice
Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 4 problems
Interviewed by Oracle
Selected 
1815 views
0 comments
0 upvotes
Server Technology Engineer
2 rounds | 3 problems
Interviewed by Oracle
Selected 1133 views
0 comments
0 upvotes
Associate Consultant
3 rounds | 3 problems
Interviewed by Oracle
Selected 574 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
Rejected
1105 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
13595 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 12782 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 9048 views
2 comments
0 upvotes