Oracle Software Development Engineer II Interview Questions and Answers

Round duration - 180 minutes
Round difficulty - Easy

It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an array of integers from 0 to (N-2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number with a frequency greater than 1 as the duplicate number.

• Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
Answered by AI
Add your answer
Q2. 
Reverse String Operations Problem Statement
You are provided with a string S and an array of integers A of size M. Your task is to perform M operations on the string as specified by the indices in array A...read more
Ans. 
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
• Iterate through the array of indices and reverse the substrings accordingly

• Ensure the range specified by each index is non-empty

• Return the final string after all operations are completed
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.

Very easy

Q1. What are your strengths and weaknesses?
Add your answer
Q2. Tell me about yourself.
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer