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

MTS 1

Oracle
upvote
share-icon
4 rounds | 14 Coding problems

Interview preparation journey

expand-icon
Journey
I started my coding journey from the second year of graduation. I asked and consulted seniors on how to start in my career. I started doing DSA. In starting it was not regular but from the seventh semester, I started practicing DSA on regular basis. Meanwhile I also learned Web Development in the last phase of third year. Than, I was ready to apply in different companies.
Application story
I got a message in my telegram group about the company visiting our campus for the hiring of MTS-1. As, I was in the fourth year, it was sure that I am going to apply for it. I started preparing accordingly and got selected at last.
Why selected/rejected for the role?
I was confident during the full interview process. Actually, I worked a lot on my communications skills and I think they were the main reasons for me getting par the selection process.
Preparation
Duration: 2.5 months
Topics: Data Structures: Trees, Linked List, Stack and Queue. OOPS: Inheritance, Polymorphism. Java: Collection and Streams. Operating System: Threads, Process Management, Memory Management , Database management system: Joins, Normalization and Transactions (ACID Properties)SOLID Principles
Tip
Tip

Tip 1 : Make your basics strong don't run after new technologies as a fresher companies wants your good command on DSA 
Tip 2 : Focus more on competitive programming to get into a good organization don't indulge to much in development because the first step to reach to the interview round is to clear the coding round 
Tip 3 : Do at least 2-3 Questions per day and practice daily 
Tip 4 : Also practice basic aptitude questions

Application process
Where: Campus
Eligibility: 7/10 CGPA and above,No Active Backlogs in any semester
Resume Tip
Resume tip

Tip 1 : Don't mention things in the resume that you don't have full command on you should have complete knowledge of what you mention in your resume
Tip 2 : Make your resume short and if you mention projects in your resume be clear about the details of the project even if you have done that in group because the interviewer will surely ask from it.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration107 minutes
Interview date1 Oct 2020
Coding problem2

The test was active on (Oct 1, 2020) from 7:00 PM to 09:00 PM. The duration of the test is 107 minutes.
The candidate should have completed the test by 9:45 PM.

The camera and microphone was on all the time. There was time alotted for each section. After completing one section you cannot switch to the previous section. If you go off the camera you will get a warning.
The test contained several sections and all questions were MCQs. The sections were Coding ability, Computer Science theory, Advanced data structures like AVL Tree, Verbal and Quantitative ability, etc

1. Data Structures

State complexity of merge sort. (Learn)

What is Radix Sort. (Learn).

Problem approach

Tip 1 : Practice preorder, postorder and inorder traversal questions of a tree
Tip 2 : Understand merge sort
Tip 3 : Have complete understanding of Radix sort

2. Preorder traversal to BST

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

You have been given an array/list 'PREORDER' representing the preorder traversal of a BST with 'N' nodes. All the elements in the given array have distinct values.

Your task is to construct a binary search tree that matches the given preorder traversal.

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.

Note:

It is guaranteed that a BST can be always constructed from the given preorder traversal. Hence, the answer will always exist.
Example:
From PREORDER = [20, 10, 5, 15, 13, 35, 30, 42] , the following BST can be constructed:

example

Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date5 Oct 2020
Coding problem6

The Round started at 10:15 am and ended at 10:45 am approx. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer both camera and microphone was on. The interviewer was really supportive and hepled me in thinking different approches of a problem.

1. Check if number is Binary

Easy
10m average time
90% success
0/40
Asked in companies
VisaDisney + HotstarOracle

Given a string of integers ‘bin’. Return 'true' if the string represents a valid binary number, else return 'false'. A binary number is a number that has only 0 or 1 in it.

Problem approach

Step 1 : First I converted the number into string and checked if each character is 0 or 1
Step 2 : The interviewer asked me if there is any other approach to solve this problem
Step 3 : I picked the approach of picking up the digit of integer from last and then checking whether that it is 0 or 1

Step 4 : If we get a digit other than 0/1 we will break the loop. The interviewer was happy with this approach.

Try solving now

2. Rearrange The Array

Moderate
15m average time
90% success
0/80
Asked in companies
AdobeMicrosoftThought Works

You are given an array/list 'NUM' of integers. You are supposed to rearrange the elements of the given 'NUM' so that after rearranging the given array/list there are no two adjacent elements present in the rearranged 'NUM' which will be the same.

For example:
Input: NUM[] = {1,1,1,2,2,2} 
Output: {1,2,1,2,1,2}
Note: {2,1,2,1,2,1} is also valid because there are no two adjacent which are the same.
Problem approach

Tip 1 : I looked through the array and used a map to count frequency of each digit

Try solving now

3. Number and Digits

Easy
15m average time
80% success
0/40
Asked in companies
OracleZomatoPaytm (One97 Communications Limited)

You are given a positive number ‘N.’ You need to find all the numbers such that the sum of digits of those numbers to the number itself is equal to ‘N.’

For example:
You are given ‘N’ as 21, the only number whose sum of digits and the number itself equals 21 is 15 as 15 + 1 + 5 = 21. Hence the answer is [15].
Problem approach

Step 1 : We can sort the array by sort() function but this would have a complexity of O(nlogn)
Step 2 : Interviewer told me to go for another approach that would have complexity lesser than this
Step 3 : I took first and last pointer in the array that will point to the start and end of the array respectively. We will swap first with last. If we find 0 in the last and 1 in the first we will continue to increment the first and decrement the last pointer until we reach the mid of the array and this approach has complexity O(n)
Step 4 : Interviewer was quite happy with this approach

Try solving now

4. Reverse a string

Easy
15m average time
85% success
0/40
Asked in companies
FacebookAckoTata Consultancy Services (TCS)

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity. 
Problem approach

Step 1 : I converted string into a character array
Step 2 : I took first and last pointer in the array that will point to the start and end of the array respectively. I swapped first with last and continued to increment the first and decrement the last pointer until I reached the mid of the array and this approach has complexity O(n)
 

Try solving now

5. Puzzle

You have 10 coins one of them is defective. You have a weight scale. How will you identify the defective coin?

Problem approach

Tip 1 : I started explaining to him we have 3 coins and each correct coin weighs 1gram and defective coin weighs 0.5 gram
Tip 2 : First I will put coin 1 and 2 on the weight scale and weigh them and if I get weight as 1.5gram it means one of them is defeated so I will again weight the left over coin with each coin and by this approach we will get the defective coin
Tip 3 : The interviewer was not satisfied. He asked me if you have 10 coins how will you identify
Tip 4 : I said we will equally divide the coins and weight 5 coins in one slot and then keep on applying the divide and conquer approach till we get the defective coin.

6. Operating System

What will be the result when we will add two binary numbers in 64Bit and 32 Bit operating system?

Problem approach

Tip 1 : Read concepts of 64Bit and 32Bit Operating System properly

03
Round
Medium
Video Call
Duration30 minutes
Interview date5 Oct 2020
Coding problem2

It took place at 11:30am(approx) and last for about 30 minutes
We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.

1. Rewrite code

There were 5 statements code snippets in python. I was told to write that in Java.

Problem approach

Firstly I tried to understand the code snippets because I have no knowledge of python. I asked the interviewer to please specify the input and output of these snippets so that I can easily code them in Java. There were 5 problems. I was able to solve each of them. There was a question of dictionary in python so relatively I used map in Java to solve that question.

2. Situation based questions

Have you ever faced criticism in life and how have you to tried to overcome it?
Have you ever done anything by stepping out of your comfort zone?

Problem approach

Tip 1 : Try to relate with real life stories that you have.
Tip 2 : Always stick to the topic or question

04
Round
Easy
HR Round
Duration30 minutes
Interview date5 Oct 2020
Coding problem4

It took place around 1:30pm and last for 30 minutes. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.

1. Tell me something about yourself?

Problem approach

Tip 1 : Prepare the points that you will speak in your introduction prior to the interview.
Tip 2 : Tell about your current cgpa, achievements and authenticated certification
Tip 3 : I told about my role in current internship and what all I do

2. Work Experience

What all you did in internships? What all technologies you have worked on? What is your project in internship?

Problem approach

Tip 1  :Mention the framework, Frontend, Backend ,Database in technologies
Tip 2 : Be clear with the project of internship if you are mentioning in the resume

3. Why you want to be a part of Oracle?

Problem approach

Point 1 : It's the dream company of almost every fresher
Point 2 : 3rd most leading firm in software industry

4. What all you except from an organization that you work?

Problem approach

Point 1 : Learn new things each day and keep growing an as individual

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 the output of print(type("Python"))?

Choose another skill to practice
Similar interview experiences
company logo
Server Technology Engineer
2 rounds | 3 problems
Interviewed by Oracle
1908 views
0 comments
0 upvotes
company logo
Associate Consultant
3 rounds | 3 problems
Interviewed by Oracle
841 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Oracle
1003 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
1624 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
MTS 1
6 rounds | 10 problems
Interviewed by Adobe
3927 views
1 comments
0 upvotes
company logo
MTS 1
2 rounds | 5 problems
Interviewed by Adobe
1455 views
1 comments
0 upvotes
company logo
MTS 1
3 rounds | 9 problems
Interviewed by Adobe
0 views
0 comments
0 upvotes