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

SDE - 1

Oracle
upvote
share-icon
4 rounds | 10 Coding problems

Interview preparation journey

expand-icon
Journey
Hi All, I'm Sanjay Sharma, I would like to share my journey. So i was looking for switch the jobs, so i've applied from linkedin, naukri for different different companies. But i didn't get any response, later I found there was my friend who is currently working in Oracle, so I applied there from his reference, and i got interview call by them, there were 4 round of interview.
Application story
In start i applied from many online portals like naukri, linkedin and other also many sites but from this i didn't get any response, later I found that one of my friend working in Oracle so i applied through his referral.
Why selected/rejected for the role?
I've given all 4 round of interviews, but 3 round coding round i found little bit difficult compare to others
Preparation
Duration: 3 months
Topics: Data structures and algorithms,System design,DBMS,Operating system
Tip
Tip

Tip 1 : solve maximum coding questions
Tip 2 : develop problem solving skills
Tip 3 : do some projects

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

Tip 1: don't put false things
Tip 2: keep ur resume short

Interview rounds

01
Round
Easy
Online Coding Test
Duration30 minutes
Interview date1 Mar 2023
Coding problem3

This is my 1st round, it was held on 1st march 2023, and it was contain only basic coding questions and it seems for me easy.

1. Reverse Words In A String

Easy
10m average time
90% success
0/40
Asked in companies
UnacademyIBMOptum

You are given a string 'str' of length 'N'.


Your task is to reverse the original string word by word.


There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.


Example :
If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
Problem approach

1. Create an empty string to hold the reversed string
2. Loop through the input string from the end to the beginning
3. For each character, append it to the empty string
4. Return the reversed string

Try solving now

2. Largest Element in the Array

Easy
10m average time
90% success
0/40
Asked in companies
MakeMyTripOracleMorgan Stanley

Given an array ‘arr’ of size ‘n’ find the largest element in the array.


Example:

Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5]

Output: 5

Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5.
Problem approach

1. Initialize a variable to hold the maximum element, set it to the first element in the array
2. Loop through the array starting at the second element
3. If the current element is greater than the maximum element, update the maximum element
4. Return the maximum element

Try solving now

3. Factorial of a Number

Moderate
25m average time
70% success
0/80
Asked in companies
HCL TechnologiesWells FargoSquadstack

You are given an integer ‘N’. You have to print the value of Factorial of ‘N’. The Factorial of a number ‘N’ is defined as the product of all numbers from 1 to ‘N’.

For Example:
Consider if ‘N’ = 4, the Factorial of 4 will be the product of all numbers from 1 to 4, which is 1 * 2 * 3 * 4 = 24. Hence, the answer is 24.
Problem approach

1. Initialize a variable to hold the factorial, set it to 1
2. Loop through the integers from 1 to the input number
3. Multiply the factorial by each integer in the loop
4. Return the factorial

Try solving now
02
Round
Medium
Online Coding Test
Duration40 minutes
Interview date1 Mar 2023
Coding problem3

This was my 2nd round, and it was also data structures and algorithms questions.

1. Maximum Depth Of A Binary Tree

Easy
15m average time
85% success
0/40
Asked in companies
FacebookWalmartRed Hat

You are given the root node of a binary tree with N nodes, whose nodes have integer values. Your task is to find the maximum depth of the given Binary tree.

Depth of a binary tree is the same as its height. In simpler terms, you have to find the total number of nodes encountered while moving from the root node to the farthest leaf node, along the longest path of the binary tree.

Example:-

example

If we are given the above binary tree as input then moving from root node(5) to the farthest leaf node(50), the path formed will be [ 5->10->25->35->40->45->50 ]. The total number of nodes encountered is 7, therefore the maximum depth of the binary tree is 7.
Problem approach

1. Check if the root node is null, if so, return 0
2. Recursively find the maximum depth of the left subtree and right subtree
3. Return the maximum of the two depths plus one (to account for the root node)

Try solving now

2. N-th Fibonacci Number

Moderate
40m average time
70% success
0/80
Asked in companies
MathworksAmazonOracle

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:
F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.
For Example:
For ‘N’ = 5, the output will be 5.
Problem approach

1. Create an array to hold the first two Fibonacci numbers (0 and 1)
2. Loop from 2 to n, adding the previous two Fibonacci numbers to get the current
3. Fibonacci number
Return the nth Fibonacci number

Try solving now

3. OOPs Question

Create a class to represent a circle with a given radius, and calculate its circumference and area.

Problem approach

1. Create a Circle class with a radius instance variable
2. Define methods to set and get the radius
3. Define methods to calculate the circumference and area using the radius
Use the formula C = 2 * pi * r for circumference and A = pi * r * r for area

03
Round
Hard
Online Coding Test
Duration1 hr
Interview date2 Mar 2023
Coding problem3

This was my 3rd round for me it's tough compare to others. This round contains problem from system design, DBMS, operating system

1. System Design Question

Design a URL shortening service.

Problem approach

1. Define the requirements and constraints of the service
2. Choose appropriate data storage and retrieval mechanisms
3. Implement a system to generate unique short URLs for long URLs, and to redirect users from short URLs to long URLs

2. DBMS Question

Select all records from a table where a particular column value equals a given value.

Problem approach

1. Write an SQL query to select records from the table
2. Use a WHERE clause to filter records where the column value equals the given value
3. Execute the query

3. Operating System Question

Implement a mutex lock using semaphores.

04
Round
Medium
HR Round
Duration20 minutes
Interview date2 Mar 2023
Coding problem1

It was last round hr round.

1. Basic HR Questions

What inspired you to become a developer?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 2 problems
Interviewed by Oracle
10595 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
2947 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
1691 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes