Oracle Application Developer Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

This was a proctured online coding test where we had 2 questions to solve under 60 minutes.

Q1. 
Minimum Cost to Connect All Points Problem Statement
Given an array COORDINATES representing the integer coordinates of some points on a 2D plane, determine the minimum cost required to connect all points...read more
View 1 more 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
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 question of DSA followed by some questions from DBMS and Java. I was also made to execute a SQL query at the end.

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
Add your answer
Q2. Can you explain the different types of normalization forms in a DBMS?
Add your answer
Q3. Can you write a SQL query that joins two tables A and B on the common attribute ID and selects records (ID_NAME) that have matching ID values in both tables?
Add your answer
Q4. Why is Java considered platform independent, while the Java Virtual Machine (JVM) is platform dependent?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had two preety straight forward questions related to DSA and then there were 2 puzzles.

Q1. 
Find All Occurrences in Matrix
You are provided with a matrix of characters, CHARACTER_MATRIX of size M x N, and a string WORD. Your goal is to locate and display all occurrences of the string within the ...read more
Add your answer
Q2. 
Greatest Common Divisor Problem Statement
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions.

Q1. Why do you want to be a part of Oracle?
Add your answer

The test had 15 aptitude and 2 coding questions

Q1. 1. technical questions based on OOPS
Add your answer
Q2. 2. Coding question on trees
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was an online proctured coding test where we had 2 questions to solve under 60 minutes. The questions were of Easy to Medium level.

Q1. 
Infix to Postfix Conversion
You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
Explanation:
An i...read more
Add your answer
Q2. 
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
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

In this round, the interviewer asked me 2 questions related to DSA and then some questions from OS were asked to check basic understanding of the subject.

Q1. 
Palindromic Substrings Problem Statement
Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
Explanation:
A string is considered a pal...read more
Add your answer
Q2. 
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...read more
Add your answer
Q3. What are the differences between a mutex and a semaphore?
Add your answer
Q4. Can you explain the concepts of multitasking and multiprogramming?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions from DSA which were followed by some core concepts from OOPS and Java.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Add your answer
Q2. 
Heap Sort Problem Statement
Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.
Input:
The first line contains an integer 'T' denoting the number of test cas...read more
Add your answer
Q3. What is the difference between an Abstract Class and an Interface in Java?
Add your answer
Q4. Can you explain the concepts of method overloading and method overriding in object-oriented programming?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions.

Q1. Can you tell me something about yourself?
Add your answer
Q2. Why do you want to be a part of Oracle?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a proctured online coding test where we had 2 questions to solve under 60 minutes. Both the questions were of Easy to Medium level of difficulty and can be solved if one has a decent command over Data Structures and Algorithms.

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
Add your answer
Q2. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions from DSA of Easy to Medium level in which I first had to explain my approach and then I had to code . After that, I was asked some questions from DBMS and SQL to check basic understanding of the subject.

Q1. 
Merge K Sorted Arrays Problem Statement
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Inpu...read more
Add your answer
Q2. 
Construct Tree from Preorder Traversal
Given a list of integers pre[] of size n, representing the preorder traversal of a special binary tree where each node has 0 or 2 children, and a boolean array isLea...read more
Add your answer
Q3. Explain the difference between the DELETE and TRUNCATE commands in a DBMS.
Add your answer
Q4. What are constraints in SQL?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round also had 2 questions from DS and Algo where I had to first explain my approach and then write the pseudo code in Google Docs. This was followed by some questions from DBMS and SQL . I was also asked to execute a SQL query at the end.

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
Add your answer
Q2. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Add your answer
Q3. What is the difference between a clustered index and a non-clustered index?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions.

Q1. Can you tell me something about yourself?
Add your answer
Q2. Why do you want to be a part of Oracle?
Add your answer