i
Oracle
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
Basic DSA questions on Strings and Tree
Shallow copy only copies the references of objects, while deep copy creates new copies of objects.
Shallow copy creates a new object but does not create copies of nested objects.
Deep copy creates new copies of all nested objects.
Shallow copy is faster and more memory efficient, but changes to nested objects affect both copies.
Deep copy is slower and uses more memory, but changes to nested objects do not affect the origi
I applied via Campus Placement and was interviewed before Aug 2023. There were 4 interview rounds.
Solve sudoku without using backtracking kr reccursion
A simple DSA ladder question , leetcode medium difficulty
JavaScript, oops, and a leetcode medium DSA question
I want to join Oracle because of their reputation for innovation and cutting-edge technology.
Opportunity to work with cutting-edge technology
Reputation for innovation and excellence
Potential for career growth and development
Strong company culture and values
I love the diverse culture, vibrant food scene, and endless opportunities for growth in this city.
Diverse culture with people from all over the world
Vibrant food scene with a wide range of cuisines to explore
Endless opportunities for personal and professional growth
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
Traversing a singly linked list involves iterating through each node starting from the head node.
Start at the head node
Iterate through each node by following the 'next' pointer
Stop when reaching the end of the list (next pointer is null)
What people are saying about Oracle
I applied via Naukri.com and was interviewed in Mar 2022. There were 3 interview rounds.
The first round of the Application Developer interview involves a test with sections on Aptitude, Dbms, Java Core, and Os.
The test will likely assess your general problem-solving skills and knowledge of specific programming languages and systems.
Be prepared to answer questions about database management, Java programming, and operating systems.
Examples of questions might include writing code to solve a problem, identify...
Oracle interview questions for designations
I was interviewed in Jun 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was a proctured online coding test where we had 2 questions to solve under 60 minutes.
Given an array COORDINATES
representing the integer coordinates of some points on a 2D plane, determine the minimum cost required to connect all points...
The problem involves finding the minimum cost to connect all points on a 2D plane using Manhattan distance.
Create a function that calculates the Manhattan distance between two points.
Implement a function to find the minimum spanning tree to connect all points.
Consider using Prim's or Kruskal's algorithm for finding the minimum spanning tree.
Ensure that all points are connected with one simple path only.
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...
Count the total 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.
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.
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...
Remove the Kth node from the end of a singly linked list given the position 'K'.
Traverse the list to find the length 'N' of the linked list.
Calculate the position from the beginning as 'N - K + 1'.
Delete the node at the calculated position from the beginning.
Normalization forms in a DBMS help reduce data redundancy and improve data integrity.
1NF (First Normal Form) - Each column contains atomic values, and there are no repeating groups.
2NF (Second Normal Form) - Meets 1NF and all non-key attributes are fully functional dependent on the primary key.
3NF (Third Normal Form) - Meets 2NF and there are no transitive dependencies between non-key attributes.
BCNF (Boyce-Codd Normal...
Yes, I can write a SQL query to join two tables on a common attribute and select matching records.
Use INNER JOIN to join tables A and B on the common attribute ID
Select the records (ID_NAME) where ID values match in both tables
Java is platform independent because the code is compiled into bytecode that can run on any system with a JVM, which is platform dependent.
Java code is compiled into bytecode, which is a platform-independent intermediate code
The JVM interprets and executes the bytecode on different platforms, making it platform dependent
The JVM acts as a layer of abstraction between the Java code and the underlying operating system
Exam...
Round duration - 60 Minutes
Round difficulty - Medium
This round had two preety straight forward questions related to DSA and then there were 2 puzzles.
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 ...
The goal is to find all occurrences of a given string in a matrix in all eight possible directions.
Iterate through each cell in the matrix and check for the starting character of the word.
For each starting character found, check in all eight directions for the complete word.
Keep track of the coordinates of each character in the word for each occurrence.
Print the coordinates of each character for each occurrence found.
I...
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...
Finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.
Iterate through each test case
Use Euclidean algorithm to find GCD
Output the GCD for each test case
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Get interview-ready with Top Oracle Interview Questions
I applied via Naukri.com and was interviewed in Nov 2021. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before Mar 2022. There were 3 interview rounds.
The test had 15 aptitude and 2 coding questions
I was interviewed before Jan 2021.
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.
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.
An i...
Convert a given infix expression to a postfix expression.
Use a stack to keep track of operators and operands
Follow the rules of precedence for operators
Convert the infix expression to postfix using the stack
Handle parentheses by pushing them onto the stack and popping when necessary
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 beg...
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 the key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
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.
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string
Check if each substring is a palindrome
Store distinct palindromic substrings in alphabetical order
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...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
Mutex is used for exclusive access to a resource, while semaphore is used for controlling access to a resource by multiple threads.
Mutex is binary and allows only one thread to access the resource at a time.
Semaphore can have a count greater than one, allowing multiple threads to access the resource simultaneously.
Mutex is used for protecting critical sections of code, while semaphore is used for synchronization betwee...
Multitasking involves executing multiple tasks simultaneously, while multiprogramming involves running multiple programs on a single processor.
Multitasking allows multiple tasks to run concurrently, switching between them quickly.
Multiprogramming involves loading multiple programs into memory and executing them concurrently.
Examples of multitasking include running multiple applications on a computer or a smartphone.
Exa...
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.
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.
...Merge two sorted linked lists into a single sorted linked list with linear time complexity and constant space usage.
Iterate through both linked lists simultaneously, comparing elements and merging them into a new linked list
Update the pointers of the new linked list as you merge elements from the two input linked lists
Ensure to handle cases where one linked list is empty or both linked lists are empty
Maintain the sorte...
Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.
The first line contains an integer 'T' denoting the number of test cas...
Heap Sort algorithm is used to sort an array of integers in non-decreasing order.
Implement Heap Sort algorithm to sort the array in non-decreasing order.
Use a max heap to sort the array in ascending order.
Time complexity of Heap Sort is O(n log n).
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructors, member variables, and methods, while interface cannot have any of these.
A class can extend only one abstract class but can implement multiple interfaces.
Abstract classes are used to provide a common base for subclasses, while interfaces are used to define a contract for cl...
Method overloading is when multiple methods in the same class have the same name but different parameters. Method overriding is when a subclass provides a specific implementation of a method that is already provided by its superclass.
Method overloading allows a class to have multiple methods with the same name but different parameters. For example, having multiple constructors in a class with different parameter lists.
...
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
I was interviewed before Feb 2021.
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.
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...
The task is to determine if it is possible to partition an array into two subsets with equal sum.
Iterate through all possible subsets of the array using recursion.
Keep track of the sum of elements in each subset.
Check if the sum of elements in both subsets is equal.
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
Count the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1)) / 2.
Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
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.
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.
Merge K sorted arrays into a single sorted array.
Create a min heap to store the first element of each array along with the array index.
Pop the root of the heap (smallest element) and add it to the result array.
If the array from which the element was taken has more elements, add the next element to the heap.
Repeat until all elements are processed.
Time complexity: O(N log K) where N is the total number of elements and K
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...
Construct a binary tree from preorder traversal and leaf node information.
Create a binary tree using preorder traversal and leaf node information
Use recursion to build the tree
Identify leaf nodes based on the isLeaf array
Handle multiple test cases separately
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers ON DELETE triggers, while TRUNCATE does not trigger any triggers.
DELETE is slower as it logs individual row deletions, while TRUNCATE is faster as it logs the deallocation of th...
Constraints in SQL are rules that are enforced on columns or tables to ensure data integrity and consistency.
Constraints ensure data accuracy and reliability.
Common constraints include NOT NULL, UNIQUE, PRIMARY KEY, FOREIGN KEY, and CHECK.
NOT NULL constraint ensures a column cannot have a NULL value.
UNIQUE constraint ensures that all values in a column are unique.
PRIMARY KEY constraint uniquely identifies each record i...
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.
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...
Given a sorted N * N matrix, find the position of a target integer X.
Iterate through each row and column to search for the target integer
Utilize the sorted nature of the matrix to optimize the search process
Return the position of the target integer if found, else return -1 -1
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through each character in the string and use a stack to keep track of opening parentheses
If an opening parenthesis is encountered, push it onto the stack
If a closing parenthesis is encountered, check if it matches the top of the stack. If not, the string is not balanced
If all parentheses are matched correctly and the stack i
Clustered index physically reorders the data in the table, while non-clustered index does not.
Clustered index determines the physical order of data in the table, while non-clustered index does not.
A table can have only one clustered index, but multiple non-clustered indexes.
Clustered index is faster for retrieval of data, as it directly points to the actual data rows.
Non-clustered index is faster for retrieval of speci...
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Some of the top questions asked at the Oracle Application Developer interview -
The duration of Oracle Application Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 27 interviews
5 Interview rounds
based on 80 reviews
Rating in categories
Senior Software Engineer
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Consultant
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Consultant
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Application Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
MongoDB
Salesforce
IBM