Oracle Senior Software Engineer 2 Interview Questions and Answers

Codility Test A test for 90 min is given

Q1. Tech Based Interview
Add your answer

Q1. Profile based questions
Add your answer

Q1. Manager Round to check if your background fits well
Add your answer
Q2. Scenario based questions
Add your answer

Q1. Salary and notice period negotiation
Add your answer

Q1. What is split function in ajava
Ans. 
The split function in Java is used to split a string into an array of substrings based on a specified delimiter.
• The split function takes a regular expression as a parameter to specify the delimiter.

• The result is an array of strings containing the substrings.

• Example: String str = 'Hello,World'; String[] parts = str.split(','); // parts = ['Hello', 'World']
Answered by AI
Add your answer

Sorting programs, some algorithms on logic

Q1. C# Basics Design patterns Architectural questions
Add your answer
Q2. Product Design Performance based
Add your answer
Q3. Programs on maze problem
Ans. 
Maze problem programs involve finding a path through a maze from start to finish.
• Use depth-first search or breadth-first search algorithms to solve maze problems.

• Consider using backtracking to handle dead ends in the maze.

• Implement a recursive function to explore all possible paths in the maze.

• Use a stack or queue data structure to keep track of visited cells and potential paths.
Answered by AI
Add your answer
Q4. Programs on snake ladder
Ans. 
Snake ladder program simulates a game where players move based on dice rolls.
• Create a board with 100 squares representing the snake ladder game.

• Players take turns rolling a dice and moving their token on the board.

• If a player lands on a square with a snake head, they move back to the square's tail.

• If a player lands on a square with a ladder bottom, they move to the ladder's top.

• The game continues until a player reaches
Answered by AI
Add your answer

Q1. Working in a shift ?
Ans. 
Yes, I am open to working in shifts as required for the job.
• I am flexible with my work schedule and can adapt to different shift timings.

• I have previous experience working in shifts, such as night shifts or weekend shifts.

• I understand the importance of teamwork and collaboration in a shift-based work environment.
Answered by AI
Add your answer
Q2. Why you are looking for change
Ans. 
Seeking new challenges and growth opportunities in a dynamic environment.
• Looking to expand my skill set and knowledge in a different industry

• Interested in working on cutting-edge technologies and projects

• Seeking a more collaborative and innovative work culture

• Want to take on more leadership responsibilities and mentor junior team members
Answered by AI
Add your answer

Questions on react , majorly focus on basics

Q1. Question on coding react
Add your answer

Q1. Machine coding round
Add your answer

Q1. Cultural fit questions
Add your answer

Simple apti questions

Q1. Ooops concepts and SQL basics
Add your answer
Q2. One general question
Add your answer

Q1. Coding type and your project details
Ans. 
I have experience in coding various types of software projects.
• I have worked on web development projects using HTML, CSS, and JavaScript.

• I have also developed mobile applications using Java and Kotlin.

• I have experience in backend development using Python and Node.js.

• I have worked on database management using SQL and MongoDB.

• I have implemented algorithms and data structures in C++ and Java.
Answered by AI
Add your answer

Q1. Tell me about yourself.
Add your answer
Q2. He just invites to you into the organisation and congratulate you
Add your answer

Round duration - 75 Minutes
Round difficulty - Hard

Online Round - 2 questions. 
75 minutes

Q1. Construct the Lexicographically Largest Valid Sequence
You are given a positive integer N. Your task is to create the lexicographically largest sequence of length 2*N - 1 containing integers between 1 to N...read more
Ans. Backtracking Approach
Approach:
 
In this approach, we will be trying to find the valid sequence using backtracking. We will be creating our sequence from left to right and will be trying to fix the biggest possible integer yet to be used at the current position. We are fixing the biggest integer first because that will give us the lexicographically largest sequence that is possible. For every position, we will be fi...read more
Answered Anonymously
Add your answer
Q2. Zuma Game
You have several balls on the table in the form of a string named 'BOARD'. The colors of the balls can be red(R), blue(B), green(G), white(W), and yellow(Y). You also have several balls i...read more
Ans. Recursive Approach
The idea here is to use recursion. At each step, we plan to insert the remaining balls in the string hand to the string board. Now the question arises, in which position do we have to insert the ‘i’th character of the string hand? The answer is simple; we have to insert ‘i’th character to all the positions on board to get all possible answers. That’s why we are using the recursive approach. After inse...read more
Answered Anonymously
Add your answer

Round duration - 40 Minutes
Round difficulty - Hard

1 Coding problem and 1 OOP problem

Q1. Ninja and Chocolates
Ninja is hungry and wants to eat his favorite chocolates but his mother won’t let him eat since he has already eaten enough chocolates. There are ‘N’ jars filled with chocolates. His m...read more
Ans. Brute Force
The brute force approach to this problem is that we continuously iterate on the speed of eating chocolates till Ninja can eat all the chocolates within ‘M’ Minutes.
 
Algorithm:
1. Make a variable ‘sum’, which will store the sum of all chocolates which are present in all N jars.
2. Now to find the starting speed, we’ll use the fact that our required speed has to be greater than the average speed(sum/M), else the ...read more
Answered Anonymously
Add your answer
Q2. OOP Question
Virtual function and abstract class
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

Resume based problems, OOPs, DBMS, OS problems

Q1. System Design Question
Design linkedin kind platform
Add your answer

Round duration - 15 Minutes
Round difficulty - Hard

Typical HR interview round. Short and crisp