Oracle Software Developer Interview Questions, Process, and Tips

Round duration - 50 Minutes
Round difficulty - Medium

two days ...could give any time

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Vertical Sum in a Binary Tree
Given a binary tree with positive integers at each node, calculate the vertical sum for node values, where the vertical sum is the sum of nodes that can be connected by a ver...read more
Ans. 
Calculate the vertical sum of node values in a binary tree.
• Traverse the binary tree in a vertical order and keep track of the sum for each vertical line.

• Use a hashmap to store the sum for each vertical line.

• Recursively traverse the tree, updating the sum for each vertical line as you go.

• Output the vertical sums for each test case in the order they were given.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

Q1. Can you discuss your expected salary and the salary structure?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of medium difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
500+ students sat in this round out which 20 were shortlisted for the next interview round.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Use graph coloring algorithm like BFS or DFS to check if it is possible to color the graph with two colors.

• Check if any adjacent vertices have the same color. If yes, then it is not possible to color the graph as described.

• If the graph has connected components, color each compo...read more
Answered by AI
Add your answer
Q2. 
Count Inversions Problem Statement
Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...read more
Ans. 
Count the number of inversions in an integer array.
• Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

• Use a nested loop to compare each pair of elements efficiently.

• Keep a count of the inversions found and return the total count at the end.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

In this round, 2 interviewers were present. They shared Docs in which we had to write code. Our camera was on.

Q1. 
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...read more
Ans. 
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return the preorder traversal of the sum tree.
• Traverse the tree in a bottom-up manner to calculate the sum of children for each node.

• Set leaf nodes to 0 and update non-leaf nodes with the sum of their children.

• Return the preorder traversal of the modified tree.
Answered by AI
Add your answer
Q2. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
Convert a given integer number into its corresponding word representation.
• Implement a function that takes an integer as input and returns the word representation of the number in English lowercase letters.

• Break down the number into its individual digits and convert each digit into its word form (e.g., 1 to 'one', 2 to 'two').

• Combine the word forms of individual digits to form the word representation of the entire numbe...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was HR round but consisted problems related to core subjects too.

Round duration - 30 minutes
Round difficulty - Easy

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer 'X'.
• Use binary search in each row to narrow down the search space.

• Start from the top-right corner or bottom-left corner for efficient search.

• Handle cases where 'X' is not found by returning {-1, -1}.
Answered by AI
Add your answer
Q2. 
Valid Parenthesis Problem Statement
Given a string str composed solely of the characters "{", "}", "(", ")", "[", and "]", determine whether the parentheses are balanced.
Input:
The first line contains ...read more
Ans. 
Check if given string of parentheses is balanced or not.
• Use a stack to keep track of opening parentheses

• Pop from stack when encountering a closing parenthesis

• Return 'YES' if stack is empty at the end, 'NO' otherwise
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the largest such subarray found.
Answered by AI
Add your answer
Q2. 
Inplace Rotate Matrix 90 Degrees Anti-Clockwise
You are provided with a square matrix of non-negative integers of size 'N x N'. The task is to rotate this matrix by 90 degrees in an anti-clockwise directi...read more
Ans. 
Rotate a square matrix by 90 degrees anti-clockwise without using extra space.
• Iterate through each layer of the matrix from outer to inner layers

• Swap elements in groups of 4 to rotate the matrix in place

• Handle odd-sized matrices separately by adjusting the loop boundaries
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

The round was conducted in day around 3PM.

Q1. 
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...read more
Ans. 
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the results of subproblems.

• Check if the sum of the array is even before attempting to partition it.

• Iterate through the array and update the 2D array based on the sum of subsets.

• Return true if a subset with half the sum is found, false ot
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.

Q1. 
Convert Sentence to Pascal Case
Given a string STR, your task is to remove spaces from STR and convert it to Pascal case format. The function should return the modified STR.
In Pascal case, words are con...read more
Ans. 
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
• Iterate through each character in the string

• If the character is a space, skip it

• If the character is not a space and the previous character is a space or it is the first character, capitalize it
Answered by AI
Add your answer
Q2. Write an SQL query to retrieve the Nth highest salary from a database.
Ans. 
SQL query to retrieve the Nth highest salary from a database
• Use the ORDER BY clause to sort salaries in descending order

• Use the LIMIT clause to retrieve the Nth highest salary

• Consider handling cases where there might be ties for the Nth highest salary
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round was conducted 15mins after 1st round.

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list.
• Traverse the list to find the length 'N'.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Remove the node at the calculated position.

• Handle edge cases like removing the head or tail of the list.

• Update the pointers accordingly after removal.
Answered by AI
Add your answer