Oracle Software Engineer II Interview Questions and Answers

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 - Medium

This was an online coding round where we had 2 questions to solve under 75 minutes. The questions were of Medium to Hard level of difficulty and I found the problem statements to be a bit tricky.

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Approach : 

1) First make a recursive function, say ‘solve’ taking the number of opening brackets ‘opening’, number of closing brackets ‘closing’ output string ‘output’, and an array of strings ‘ans’ as arguments.

2) Make the base condition as if ‘opening’ = 0 and ‘closing’ = 0 then push the output string in the ‘ans’ and return.

3) If ‘opening’ is not equal to zero then call the ‘solve’ function recursively by decre...read more
Answered Anonymously
Add your answer
Q2. 
Longest Happy String Problem Statement
Given three non-negative integers X, Y, and Z, determine the longest happy string. A happy string is defined as a string that contains only the letters 'a', 'b', and...read more
Ans. 
Approach : 

1) Let the 'X', 'Y', 'Z' be the maximum availability ‘a’, ‘b’, ‘c’ respectively.

2) Declare an empty string say ‘S’ to store the answer string.

3) Run a loop till (x + y + z)
3.1) If ( 'X' >= 'Y' and 'X' >= 'Z' and the last two letters in ‘S’ is not “aa” ) or ( the last two letters in ‘S’ are “bb” or “cc” and 'X' is nonzero).
Add ‘a’ to ‘S’, and update 'X' to ‘x - 1’.

3.2) If ( 'Y' >= 'X' and 'Y' &g...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 preety decent questions of DSA . The interviewer was also quite freindly and helpful. I was able to solve both the questions under the given time frame and also discussed their respective time and space complexites.

Q1. 
Problem Description
Given a graph with 'N' nodes and 'M' unidirectional edges, along with two integers 'S' and 'D' representing the source and destination respectively, your task is to find all possible p...read more
Ans. 
Approach (Using Backtracking) : 

Let ‘allAllPaths(n, m, edges, src, des)’ be the function that returns a 2D array that contains all the possible paths.

1) Take the following variables: 2D array ‘Graph’, to store graphs and ‘Visited’ array to mark each node whether it is visited or not.

2) Clear graph, initialize the visited array to false.

3) Run a loop from 0 to 'm' :
3.1) Add the undirected edge between edges[i] [0] ...read more
Answered Anonymously
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Approach : 

1) Initialize slow and fast at the beginning.

2) Start moving slow to every next node and moving fast 2 jumps, while making sure that fast and its next is not null.

3) If after adjusting slow and fast, if they are referring to the same node, there is a cycle otherwise repeat the process

4) If fast reaches the end or null then the execution stops and we can conclude that no cycle exists.


TC : O(N), where N =
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 question related to BST followed by some standard questions from OOPS and Operating Systems.

Q1. 
Pair with Given Sum in a Balanced BST Problem Statement
You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such ...read more
Ans. 
Approach : 

1) Maintain a hash-map ‘mp,’ which keeps track of the nodes we have visited.

2) We will use a helper function, ‘helper’.

3) ‘helper’ takes ‘root,’ ‘target,’ and ‘mp’ as input parameters, where ‘root’ is the root of the binary tree, ‘target’ is the value which should be equal to sum of 2 nodes and ‘mp’ is the hash-map we use to keep track of nodes visited.

3.1) For a given root ‘toFind’ value is the other h...read more
Answered Anonymously
Add your answer
Q2. What is the difference between Early Binding and Late Binding in C++?
Ans. 
OOP is used commonly for software development. One major pillar of OOP is polymorphism. Early Binding and Late
Binding are related to that. Early Binding occurs at compile time while Late Binding occurs at runtime. In method
overloading, the bonding happens using the early binding. In method overriding, the bonding happens using the late
binding. The difference between Early and Late Binding is that Early Binding uses the...read more
Answered Anonymously
Add your answer
Q3. What is meant by multitasking and multithreading in operating systems?
Ans. 
Multitasking : It refers to the process in which a CPU happens to execute multiple tasks at any given time. CPU
switching occurs very often when multitasking between various tasks. This way, the users get to collaborate with
every program together at the same time. Since it involves rapid CPU switching, it requires some time. It is because
switching from one user to another might need some resources. The processes in mult...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

Q1. What is something about you that is not included in your resume?
Ans. 
If you get this question, it's an opportunity to choose the most compelling information to share that is not obvious from
your resume.

Example :

Strength -> I believe that my greatest strength is the ability to solve problems quickly and efficiently, which makes me
unique from others.

Ability to Handle Pressure -> I enjoy working under pressure because I believe it helps me grow and become more
efficient .


Tip : Emphasi...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
String Compression Problem Statement
Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...read more
Ans. Frequency Calculation Approach
The steps are as follows:
 
1. Keep two indices, both starting from the initial character. Let’s say, ‘STARTINDEX’ and ‘ENDINDEX’. These indices are going to tell the start and end of the substring where the characters are the same.
2. Start moving the ‘ENDINDEX’ to every character till the character at ‘STARTINDEX’ is a match.
3. Whenever there is a mismatch, we can calculate the frequency of the...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was my first technical round. he asked me about all my projects and the technologies used. some questions were on c and c++. what is heap , stack, memory allocation methods. Basically they covered all the concepts of c from string to pointers. Then they gave me one coding question which was on arrays. Best part was interviewers were very friendly.

Q1. 
Jumping Numbers Problem Statement
Given a positive integer N, your task is to find and display all jumping numbers that are less than or equal to N.
A number is termed a jumping number if every adjacent ...read more
Ans. Brute Force
• A brute force approach could be to iterate over all the integers from 0 to N.
• For each integer check if its adjacent digits differ by 1. If yes, then the number is a jumping number.
 
The steps are as follows:
 
• Iterate over the integers, 0 to ‘N’.
• For each integer, iterate over its digits.
  • Check if the current digit and the previous digit differ by 1.
• If all the adjacent digits in the current integer diff...read more
Answered Anonymously
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

This round was completely on data structures . he asked me all the questions related to linked list like detect a loop, remove a loop and graphs like BFS and DFS algorithms and some on trees. even on Adjacency matrix and adjacency list.

Round duration - 60 minutes
Round difficulty - Medium