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

SDE - 1

Oracle
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Data Structures - Arrays, Strings, Linked List, Trees, Binary Search Tree, Graph, Tries, Fenwick Trees, Segment Trees, Hashmap, Algorithms - Recursion, Ad Hoc, Dynamic Programming, Greedy, Binary Search, Breadth-first search, Depth-first search, Sorting
Tip
Tip

Tip 1 : Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer.

Tip 2 : The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding.

Tip 3 : Also you may practice on Geeks For Geeks or any other interview portal.

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

Tip 1 : Mention all internships which you have done, as it increases your chances of shortlisting your resume. 
Tip 2 : Also just write that skills which you are pretty confident about.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date26 Oct 2020
Coding problem2

The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of medium difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
500+ students sat in this round out which 20 were shortlisted for the next interview round.

1. Colour the Graph

Moderate
20m average time
80% success
0/80
Asked in companies
MeeshoChegg Inc.Microsoft

You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. You have to colour this graph in two different colours, say blue and red such that no two vertices connected by an edge are of the same colour.

Note :
The given graph may have connected components.
Try solving now

2. Count Inversions

Moderate
40m average time
55% success
0/80
Asked in companies
Hewlett Packard EnterpriseBNY MellonGrab

For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.

An inversion is defined for a pair of integers in the array/list when the following two conditions are met.

A pair ('ARR[i]', 'ARR[j]') is said to be an inversion when:

1. 'ARR[i] > 'ARR[j]' 
2. 'i' < 'j'

Where 'i' and 'j' denote the indices ranging from [0, 'N').
Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date28 Oct 2020
Coding problem2

In this round, 2 interviewers were present. They shared Docs in which we had to write code. Our camera was on.

1. Sum Tree

Moderate
29m average time
0/80
Asked in companies
OYOAmazonOracle

For a given binary tree, convert it to its sum tree. That is, replace every node data with sum of its immediate children, keeping leaf nodes 0. Finally, return its preorder.

For example:
The input for the tree depicted in the below image would be :

alt text

1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
Explanation :
Level 1 :
The root node of the tree is 1

Level 2 :
Left child of 1 = 2
Right child of 1 = 3

Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6

Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)

Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).
Note :
The above format was just to provide clarity on how the input is formed for a given tree. 
 In the input, each value of the sequence will be present on a separate line.
Try solving now

2. Convert a given number to words

Easy
15m average time
80% success
0/40
Asked in companies
Goldman SachsHSBCOracle

Given an integer number ‘num’. Your task is to convert ‘num’ into a word.

Suppose the given number ‘num’ is ‘9823’ then you have to return a string “nine thousand eight hundred twenty three” that is word conversion of the given ‘num’ 9823.

Try solving now
03
Round
Easy
Face to Face
Duration30 minutes
Interview date30 Oct 2020
Coding problem2

This was HR round but consisted problems related to core subjects too.

1. OOPS Questions

What is a virtual function? Give an example.

What is encapsulation? What is polymorphism?

2. Basic HR Questions

Introduce yourself and why are you intrested in Computer science?
Why Oracle.

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
SDE - 1
3 rounds | 2 problems
Interviewed by Oracle
10749 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Oracle
3011 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
1728 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58238 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes