New update is available. Click here to update.
Application Developer
Oracle
4 rounds | 11 Coding problems
1360 views
0 comments
1 upvotes
Interview preparation journey
Preparation
Duration: 4 Months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

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

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds
01
Round
Medium
Online Coding Test
Duration60 Minutes
Interview date16 Jun 2021
Problems2
Minimum Cost to Connect All Points

#### You are given an array, ‘COORDINATES’ that represents the integer coordinates of some points on ...

view more
Problem approach

Approach (Using Kruskal's Algo) :

1) First, we will add all the edges (that can be formed by any two points) and their cost in a min-heap.

2) Now, we will process each and every edge present in the min-heap one by one.

3) If the current edge in processing forms a cycle in the MST, then discard the edge; otherwise, include it in the MST. We will be adding the cos...

view more
Count Inversions

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

view more
Problem approach

Approach (Using Merge Sort) :

1) The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.

2 )Create a function merge that counts the number of inversions when two halves of the array are merged, create two indices i and j, i is the index for the first half, and j is an index of the second half. if ...

view more
02
Round
Medium
Video Call
Duration60 Minutes
Interview date16 Jun 2021
Problems4
Delete Kth node From End

#### You have been given a singly Linked List of 'N' nodes with integer data and an integer 'K'. Your task is to remove the Kth node from the end of the given Linked List.

##### For example:
<...
view more
Problem approach

Approach (Using Slow and Fast Pointers) :

1) Initially, the 'FAST' pointer advances the list by 'K' nodes from the beginning and the 'SLOW' is a pointer to the head of the linked list.

2) Now both pointers are exactly separated by 'K' distance from each other. We will maintain a constant gap by advancing both pointers together until the 'FAST' pointer reaches the last node.<...

view more
DBMS Question

Explain different types of Normalization forms in a DBMS.

Problem approach

Normalization is the process of minimizing redundancy from a relation or set of relations. Redundancy in relation may cause insertion, deletion, and update anomalies. So, it helps to minimize the redundancy in relations. Normal forms are used to eliminate or reduce redundancy in database tables.

Types of Normal Form :

1) 1NF: It is known as the first normal form and is the simples...

view more
SQL Question

Write a query that joins two tables A and B having common attribute ID and selects records(ID_NAME) that have matching ID values in both tables .

Problem approach

SELECT A.ID_Name, B.ID_Name
FROM A
INNER JOIN B ON A.ID=B.ID;

Java Question

Why Java is platform independent and JVM platform dependent?

Problem approach

JVM is platform dependent because it takes java byte code and generates byte code for the current operating system. So Java software is platform dependent but Java language is platform independent because different operating system have different JVMs.

03
Round
Medium
Video Call
Duration60 Minutes
Interview date16 Jun 2021
Problems4
Find all occurrences

#### You are given a 'M' x 'N' matrix of characters, 'CHARACTER_MAT...

view more
Problem approach

Approach :

1)Iterate through the string and keep a count of the given character in a variable ct.
2) If ct==count, strore the index in a variable say idx and break from the loop
3) Final Ans=string.substr(idx)

TC : O(N) , where N=length of the string
SC : O(1)

Greatest Common Divisor

#### The Greatest Common Divisor of any two integers is the l...

view more
Problem approach

//Pseudo Code :
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}

TC : O(log(min(a,b))
SC : O(1)

Puzzle

You have 10 coins….arrange them in 4 straight lines such that each line contains 4 coins, without picking up the pencil.

Problem approach

Answer :

0 0 0 0
0
0
0 0 0 0

This is the required configuration

Puzzle

A lady has 10 bags full of coins. Each bag contains 1000 coins. But one bag is full of forgeries, and she just can’t recall which one. She does know that genuine coins weigh 1 gram, but forgeries weigh 1.1 grams. To hide the fact that she can’t recall which bag contains forgeries, she needs your help. How can she identify the bag with the forgeries with just one weighing?

Problem approach

Approach :
The lady should take out 1 coin from the 1st bag, 2 coins from the 2nd bag, 3 coins from the 3rd bag and similarly 10 coins from the 10th bag.
Now she should simply weigh all these picked coins together.
If there were no forgeries, then the total weight should be (1+2+3+ . . . +10) = 55 grams.
Now, if the total weight comes out to be 55.3 then she can conclude that ...

view more
04
Round
Easy
HR Round
Duration30 Minutes
Interview date16 Jun 2021
Problems1
Basic HR Question

Why you want to be a part of Oracle?

Problem approach

Tip 1 : Oracle technologies are modern, cutting edge and built for enterprise requirements (think world class security, availability, performance, scalability, integrated ML/AI and so forth). Oracle Database is #1 worldwide.
Tip 2 : Since it’s inception, Oracle has become a market leader when it comes to database. Oracle has its own all possible solution for it’s clients whether it is into I...

view more
Start a Discussion
Similar interview experiences
MTS 1
4 rounds | 14 problems
Interviewed by Oracle
1572 views
0 comments
0 upvotes
Server Technology Engineer
4 rounds | 6 problems
Interviewed by Oracle
6 views
0 comments
0 upvotes
Associate Consultant
3 rounds | 3 problems
Interviewed by Oracle
3 views
0 comments
0 upvotes
Software Developer
3 rounds | 6 problems
Interviewed by Oracle
10 views
0 comments
0 upvotes
Companies with similar interview experiencs
Application Developer
2 rounds | 5 problems
Interviewed by Qualcomm
775 views
0 comments
0 upvotes
Application Developer
4 rounds | 7 problems
Interviewed by Thought Works
310 views
1 comments
0 upvotes
Application Developer
3 rounds | 17 problems
Interviewed by Fujitsu
229 views
0 comments
0 upvotes