AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Oracle
Compare
Filter interviews by
Oracle Mts1 Interview Questions and Answers
7 Interview questions
A singleton class is a class that can only have one instance created at a time.
Singleton classes are often used for managing resources that should only have one instance, such as a database connection.
They are implemented by making the constructor private and providing a static method to access the single instance.
Singleton classes can also be used for global state management in an application.
In Java, the Singlet...
Check if a Number is Binary
Determine if a given string of integers bin represents a valid binary number. Return 'true' if the string represents a valid binary number, otherwise return 'false'. A binary nu...
Check if a given string represents a valid binary number composed of 0s and 1s.
Iterate through each character in the string and check if it is either '0' or '1'.
If any character is not '0' or '1', return 'false'.
Return 'true' if all characters are '0' or '1'.
Number and Digits Problem Statement
You are provided with a positive integer N. Your task is to identify all numbers such that the sum of the number and its digits equals N.
Example:
Input:
N = 21
Outp...
Identify numbers whose sum with digits equals given integer N.
Iterate through numbers from 1 to N and check if sum of number and its digits equals N.
Use a helper function to calculate sum of digits for a given number.
Return -1 if no such number exists for a test case.
The result of adding two binary numbers in a 64-bit and a 32-bit operating system will differ due to the different number of bits used for calculations.
In a 64-bit operating system, the result will be more accurate and can handle larger numbers compared to a 32-bit system.
Overflow may occur in a 32-bit system when adding large binary numbers, leading to incorrect results.
Example: Adding 1111 (15 in decimal) and 11...
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single in...Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
Iterate through each character in the string and append them in reverse order to a new string
Use built-in functions like reverse() or slice() to reverse the string
Handle special characters and numbers along with alphabets
Preorder Traversal to BST Problem Statement
Given an array or list PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the BST which matches the given preorde...
Given a preorder traversal of a BST, construct the BST and print its inorder traversal.
Parse the input to get the number of test cases and preorder traversal for each case
Construct the BST using the preorder traversal by recursively building the tree
Print the inorder traversal of the constructed BST for each test case
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Input...
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
Oracle Mts1 Interview Experiences
2 interviews found
I appeared for an interview in Oct 2020.
(1 Question)
Round duration - 107 minutes
Round difficulty - Medium
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
- Q1.
Preorder Traversal to BST Problem Statement
Given an array or list
PREORDERrepresenting the preorder traversal of a Binary Search Tree (BST) withNnodes, construct the BST which matches the given preord... - Ans.
Given a preorder traversal of a BST, construct the BST and print its inorder traversal.
Parse the input to get the number of test cases and preorder traversal for each case
Construct the BST using the preorder traversal by recursively building the tree
Print the inorder traversal of the constructed BST for each test case
(5 Questions)
Round duration - 30 minutes
Round difficulty - Medium
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.
- Q1.
Check if a Number is Binary
Determine if a given string of integers
binrepresents a valid binary number. Return'true'if the string represents a valid binary number, otherwise return'false'. A binary n... - Ans.
Check if a given string represents a valid binary number composed of 0s and 1s.
Iterate through each character in the string and check if it is either '0' or '1'.
If any character is not '0' or '1', return 'false'.
Return 'true' if all characters are '0' or '1'.
- Q2.
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Inpu...
- Ans.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
- Q3.
Number and Digits Problem Statement
You are provided with a positive integer
N. Your task is to identify all numbers such that the sum of the number and its digits equalsN.Example:
Input:
N = 21
Out...
- Ans.
Identify numbers whose sum with digits equals given integer N.
Iterate through numbers from 1 to N and check if sum of number and its digits equals N.
Use a helper function to calculate sum of digits for a given number.
Return -1 if no such number exists for a test case.
- Q4.
Reverse a String Problem Statement
Given a string
STRcontaining characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.Input:
The input starts with a single i... - Ans.
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
Iterate through each character in the string and append them in reverse order to a new string
Use built-in functions like reverse() or slice() to reverse the string
Handle special characters and numbers along with alphabets
- Q5. What will be the result when adding two binary numbers in a 64-bit and a 32-bit operating system?
- Ans.
The result of adding two binary numbers in a 64-bit and a 32-bit operating system will differ due to the different number of bits used for calculations.
In a 64-bit operating system, the result will be more accurate and can handle larger numbers compared to a 32-bit system.
Overflow may occur in a 32-bit system when adding large binary numbers, leading to incorrect results.
Example: Adding 1111 (15 in decimal) and 1111 (1...
Round duration - 30 minutes
Round difficulty - Medium
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 Question)
Round duration - 30 minutes
Round difficulty - Easy
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.
- Q1. Tell me something about yourself?
Interview Preparation Tips
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
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.
Skills evaluated in this interview
I applied via LinkedIn and was interviewed in Jan 2021. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. What is singleton class
- Ans.
A singleton class is a class that can only have one instance created at a time.
Singleton classes are often used for managing resources that should only have one instance, such as a database connection.
They are implemented by making the constructor private and providing a static method to access the single instance.
Singleton classes can also be used for global state management in an application.
In Java, the Singleton pa...
- Q2. Oops concept
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 140 minutes
Round difficulty - Hard
2 Separate online rounds were hosted on HackerRank . Online Aptitude Round consisted of 45 questions. Online Coding Round consisted of 3 questions.
- Q1.
Maximum Sum Problem Statement
You are given an array
ARRof N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio... - Ans.
The task is to maximize the sum of selected elements from an array by following specific rules.
Select elements strategically to maximize the sum
Remove occurrences of selected element, and its neighbors
Repeat the process until the array becomes empty
- Q2.
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Inpu...
- Ans.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
(2 Questions)
Round duration - 40 minutes
Round difficulty - Hard
The interview started of with questions about the online test, general questions on “tell me about yourself”
Then he asked me a relative velocity problem from physics section to warm things up.
It was Followed by discussion on topics taught in college, Questions on OS and DBMS.
- Q1.
Ways to Reach Nth Stair
Given the number of stairs, initially at the 0th stair, you need to reach the Nth stair. Each time, you can either climb one step or two steps. Determine the number of distinct way...
- Ans.
Calculate the number of distinct ways to climb N stairs by either taking one or two steps at a time.
Use dynamic programming to keep track of the number of ways to reach each stair
The number of ways to reach a stair is the sum of the number of ways to reach the previous two stairs
Return the result modulo 10^9+7
- Q2.
Level Order Traversal of Binary Tree
Given a binary tree of integers, return its level order traversal.
Input:
The first line contains an integer 'T' which represents the number of test cases. For each ...
- Ans.
Level Order Traversal of Binary Tree returns nodes in level order traversal.
Perform a level order traversal of the binary tree starting from the root node.
Visit nodes level by level, printing them in the order they are encountered.
Use a queue data structure to keep track of nodes at each level.
(3 Questions)
Round duration - 50 minutes
Round difficulty - Easy
The interviewer asked about my project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling, mutex, deadlocks.
- Q1.
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...
- Ans.
The task is to print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to keep track of nodes at each level.
Consider null nodes as well while traversing the tree.
- Q2.
Top View of Binary Tree Problem Statement
Given a binary tree, your task is to print the Top View of the Binary Tree. The Top View is the set of nodes visible when the tree is viewed from the top. Please ...
- Ans.
The task is to print the Top View of a Binary Tree, which is the set of nodes visible when viewed from the top, in left to right order.
Traverse the binary tree in level order and maintain a map to store the horizontal distance of each node from the root.
For each node, if the horizontal distance is not already in the map, add the node's value to the result.
Print the values from the map in ascending order of horizontal d...
- Q3. Design a system that can store an incoming stream of characters in a sorted manner and answer queries regarding whether a specific character is present or not.
- Ans.
Design a system to store incoming characters in sorted manner and answer queries about character presence.
Use a data structure like a balanced binary search tree to store characters in sorted order.
Implement functions to insert characters into the tree and check for character presence.
Optimize search queries by using binary search or tree traversal techniques.
Consider edge cases like duplicate characters and handling s...
Interview Preparation Tips
Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
Skills evaluated in this interview
I applied via Company Website and was interviewed in Nov 2022. There were 3 interview rounds.
2 medium hard problems were asled one was dynamic programming second was multi spurce bfs
(2 Questions)
- Q1. Histogram area Kth largest
- Ans.
The question is about finding the area of a histogram and the Kth largest value.
Calculate the area of the histogram by multiplying the width and height of each bar and summing them up.
Find the Kth largest value by sorting the data and selecting the Kth element.
The Kth largest value can also be found using a heap data structure.
Example: Histogram area of [2, 3, 1, 4, 5] with bar width of 1 is 15. The 3rd largest value i...
- Q2. Kth largest element in array
- Ans.
Finding the Kth largest element in an array.
Sort the array and return the Kth element from the end
Use a max heap to keep track of the K largest elements
Use quickselect algorithm to find the Kth largest element
Interview Preparation Tips
While thinking in interview think loudly
Skills evaluated in this interview
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 2 interview rounds.
1 hour 30 minutes, questions were based on coding, aptitude
(1 Question)
- Q1. Interviewer asked two coding questions.
Interview Preparation Tips
(1 Question)
- Q1. Can you please describe the latest project that you have completed?
- Ans.
I recently completed a project focused on developing a mobile app for tracking personal fitness goals and health metrics.
Conducted user research to identify key features, such as step tracking and calorie counting.
Collaborated with a team of developers to design an intuitive user interface.
Implemented a backend system for data storage and user authentication.
Launched a beta version and gathered user feedback for improv...
Interview Preparation Tips
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
(1 Question)
- Q1. Advantage and disadvantage of framework.
- Ans.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
(1 Question)
- Q1. What is Oops? Advantage and disadvantage
- Ans.
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
Interview Preparation Tips
Skills evaluated in this interview
Senior Software Engineer Interview Questions & Answers
Carelon Global Solutions
Anonymous
posted on 8 Jan 2021
Interview Questionnaire
1 Question
- Q1. Technical questions from data warehousing and ETL Concept , SQL Queries and Unix
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. 1. Core Java - OOPS features, Abstract classes and Interface, Inner Classes, String and Object Class, Equals and HashCode methods, Runtime and Compile time exception, Method overloading and overriding, Cus...
Interview Preparation Tips
2. Basic DB queries
3. Basic Unix commands
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
Interview Preparation Tips
Good and smoth interview experiance
Oracle Interview FAQs
Tell us how to improve this page.
Oracle Interviews By Designations
- Oracle Software Developer Interview Questions
- Oracle Application Developer Interview Questions
- Oracle Software Engineer Interview Questions
- Oracle Senior Software Engineer Interview Questions
- Oracle Member Technical Staff Interview Questions
- Oracle Applications Engineer Interview Questions
- Oracle Senior Consultant Interview Questions
- Oracle Associate Consultant Interview Questions
- Show more
Interview Questions from Similar Companies
Oracle Mts1 Reviews and Ratings
based on 4 reviews
Rating in categories
|
Senior Software Engineer
2.5k
salaries
|  ₹19.9 L/yr - ₹36 L/yr |
|
Principal Consultant
2.2k
salaries
| ₹20 L/yr - ₹34 L/yr |
|
Senior Consultant
2.2k
salaries
| ₹12.8 L/yr - ₹23.5 L/yr |
|
Senior Member of Technical Staff
1.9k
salaries
| ₹23.6 L/yr - ₹40.3 L/yr |
|
Software Developer
1.5k
salaries
| ₹15.2 L/yr - ₹27 L/yr |
SAP
MongoDB
Salesforce
IBM
- Home >
- Interviews >
- Oracle Interview Questions
