Oracle interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Oracle
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I first learned a programming language in my first year. Then, I practiced DSA from various platforms like Leetcode, GFG, etc. Leetcode is one of the best platforms to practise a wide variety of questions. For other subjects like OS, CN, DBMS etc, I prepared it from my college subjects only.
Application story
It was on campus drive. So we were told to fill the google form and upload the resume there. After that we got mail to online test.
Why selected/rejected for the role?
My main reason of selection was an in-depth knowledge of advanced DSA topics like Trees. I had prepared Trees very well , so I was able to give optimized approaches for Tree-based questions.
Preparation
Duration: 3 months
Topics: Oops concepts, Dbms concepts ,About my projects and internships, why should we hire you, Comparizion between various programming languages, Problem solving, Html
Tip
Tip

Tip 1 : Be strong with basic concepts of programming languages
Tip 2 : Be prepared about the project and the technologies used.
Tip 3 : Having good knowledge of the internships you have done and how should you anser problem solving questions.

Application process
Where: Campus
Eligibility: 7
Resume Tip
Resume tip

Tip 1 : Should include internships and projects
Tip 2 : Need to specify any certifications done such as java certification.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 mins
Interview date5 Nov 2019
Coding problem2

It has total six sections
I was given 7:30 pm slot. We have to be quick enough while giving the assessment.
The platform was very good and easy to handle.

1. Puzzle

Seating arrangement questions

2. Kth Smallest and Largest Element of Array

Easy
15m average time
70% success
0/40
Asked in companies
HSBCSalesforceSprinklr

You are given an array ‘Arr’ consisting of ‘N’ distinct integers and a positive integer ‘K’. Find out Kth smallest and Kth largest element of the array. It is guaranteed that K is not greater than the size of the array.

Example:

Let ‘N’ = 4,  ‘Arr’ be [1, 2, 5, 4] and ‘K’ = 3.  
then the elements of this array in ascending order is [1, 2, 4, 5].  Clearly, the 3rd smallest and largest element of this array is 4 and 2 respectively.
Problem approach

I solve using Heap concept

Try solving now
02
Round
Easy
Face to Face
Duration60 mins
Interview date20 Nov 2019
Coding problem2

1. Chocolate Problem

Moderate
15m average time
85% success
0/80
Asked in companies
EcomExpressIBMMicrosoft

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number of students and the task is to distribute the chocolate to their students. Distribute chocolate in such a way that:

1. Each student gets at least one packet of chocolate.

2. The difference between the maximum number of chocolate in a packet and the minimum number of chocolate in a packet given to the students is minimum.

Example :

Given 'N' : 5 (number of packets) and 'M' : 3 (number of students)

subsequence

And chocolates in each packet is : {8, 11, 7, 15, 2}

All possible way to distribute 5 packets of chocolates among 3 students are -

( 8,15, 7 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 8, 15, 2 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’ 
( 8, 15, 11 ) difference of maximum-minimum is ‘15 - 8’ = ‘7’
( 8, 7, 2 ) difference of maximum-minimum is ‘8 - 2’ = ‘6’
( 8, 7, 11 ) difference of maximum-minimum is ‘11 - 7’ = ‘4’
( 8, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’
( 15, 7, 2 ) difference of maximum-minimum is ‘15 - 2’ = 13’
( 15, 7, 11 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 15, 2, 11 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’
( 7, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’

Hence there are 10 possible ways to distribute ‘5’ packets of chocolate among the ‘3’ students and difference of combination (8, 7, 11) is ‘maximum - minimum’ = ‘11 - 7’ = ‘4’ is minimum in all of the above.
Problem approach

Greedy approach

Try solving now

2. Aptitude Test

6 rounds to test your Speaking, Listening and Memory.

Problem approach

Tip 1 : Listen carefully
Tip 2 : Answer properly with clear voice
Tip 3 : Use good quality headsets

03
Round
Easy
HR Round
Duration30 mins
Interview date20 Nov 2019
Coding problem1

The interviewers were friendly.
Confidence and clear communication.

1. Basic HR Questions


Describe the workplace where you’ll be most happy and productive.

Who is your role model?

Problem approach

Tip 1 : Be prepared and convey with proper simple sentences.
Tip 2 : Giving examples for each question.
Tip 3 : being honest and genuine.

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
company logo
Software Engineer
3 rounds | 3 problems
Interviewed by Oracle
2031 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Oracle
1351 views
0 comments
0 upvotes
company logo
Software Engineer
5 rounds | 13 problems
Interviewed by Oracle
0 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 3 problems
Interviewed by Oracle
0 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7976 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
10148 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4448 views
1 comments
0 upvotes