i
Oracle
Filter interviews by
Designing a hashmap from scratch
A hashmap is a data structure that allows for efficient key-value pair storage and retrieval
It typically uses an array and a hashing function to map keys to array indices
Collision handling techniques like chaining or open addressing may be used
Operations like insert, delete, and search can be implemented using the hashmap
Example: Designing a hashmap to store student records with the...
A hotel room allocation system manages room bookings, availability, and guest check-ins efficiently.
User Interface: A web/mobile app for guests to search and book rooms.
Database: Store room details, availability, and guest information.
Room Allocation Logic: Implement algorithms to allocate rooms based on preferences.
Payment Integration: Secure payment processing for bookings.
Notifications: Send confirmation and re...
SQL query using joins
Use JOIN keyword to combine rows from two or more tables based on a related column between them
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
Design a Tic Tac Toe game
Create a 3x3 grid to represent the game board
Allow two players to take turns marking X and O on the grid
Check for win conditions after each move to determine the winner
Handle tie game if all spaces are filled without a winner
What people are saying about Oracle
Circular doubly linked list is a data structure where each node has a reference to both the next and previous nodes, forming a circular loop.
Create a Node class with data, next, and prev pointers
Implement operations like insert, delete, search, and display
Ensure the last node's next pointer points to the first node and the first node's prev pointer points to the last node
Find the largest element in a window of size K in an array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Remove indices from the front of the deque that are outside the current window.
The front of the deque will always have the index of the largest element in the current window.
Infix to postfix conversion involves rearranging expressions for easier evaluation using a stack-based algorithm.
Infix notation: Operators are between operands (e.g., A + B).
Postfix notation: Operators follow their operands (e.g., AB+).
Use the Shunting Yard algorithm by Edsger Dijkstra for conversion.
Example: Infix: (A + B) * C becomes Postfix: AB+C*.
Minimum 7 races required to find the top 3 fastest horses.
Divide the 25 horses into 5 groups of 5 horses each.
Conduct a race among the horses in each group to determine the fastest horse in each group.
Take the top 2 horses from each group and conduct a race among them to determine the fastest horse overall.
The winner of this race is the fastest horse.
Now, take the second-place horse from the final race and the sec...
Implementing a sorting algorithm in Java to arrange an array of numbers in ascending order.
Use Arrays.sort() method for simplicity: Example: int[] numbers = {5, 3, 8}; Arrays.sort(numbers); // Result: {3, 5, 8}
Implement Bubble Sort for educational purposes: Iterate through the array, swapping adjacent elements if they are in the wrong order.
Consider Quick Sort for efficiency: Divide the array into sub-arrays and s...
Retrieve staff members in departments and departments for staff members using SQL queries.
Query 1: To get all departments for a specific staff member, use a JOIN between Staff and Department tables.
Example: SELECT d.department_name FROM Department d JOIN Staff s ON d.department_id = s.department_id WHERE s.staff_id = 1;
Query 2: To get all staff members for each department, use a JOIN and GROUP BY.
Example: SELECT d...
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
Merge two sorted arrays into a single sorted array
Create a new array to store the merged result
Use two pointers to iterate through both arrays and compare elements
Add the smaller element to the new array and move the pointer for that array
Find the maximum length of a subarray with a given sum in an array.
Use a hashmap to store the running sum and its corresponding index.
Iterate through the array and update the hashmap with the running sum.
Check if the difference between the current sum and the target sum exists in the hashmap to find the subarray length.
Implementing OOP concepts like encapsulation, inheritance, and polymorphism in a practical application.
Encapsulation: Use classes to bundle data and methods. Example: A 'Car' class with properties like 'speed' and methods like 'accelerate()'.
Inheritance: Create a base class and derive subclasses. Example: A 'Vehicle' class and subclasses 'Car' and 'Bike'.
Polymorphism: Use method overriding to allow different classes to...
Parent and Child Trees
Calculate the area of a shape using coordinates
Determine the type of shape (e.g. rectangle, triangle, circle)
Use the appropriate formula for the shape to calculate the area
Input the coordinates into the formula to get the area
I applied via Campus Placement
MCQ and DSA questions
I appeared for an interview in Jan 2025, where I was asked the following questions.
A voting system allows users to cast votes securely and anonymously for candidates or options in an election.
User Registration: Users must register with valid identification to vote.
Voting Process: Users can select candidates/options and submit their votes securely.
Anonymity: Votes should be anonymous to protect voter privacy.
Security: Implement encryption to protect vote data and prevent tampering.
Results Tallying: Vo...
Design a flight system using graph theory to manage routes, connections, and scheduling efficiently.
Model airports as nodes and flights as directed edges between them.
Use Dijkstra's algorithm for finding the shortest path between two airports.
Implement a priority queue to manage flight schedules and delays.
Consider adding features for layovers and multi-leg journeys.
Example: A flight from A to B with a layover at C can...
Intersection of linked list is finding the common node where two linked lists merge.
Traverse both linked lists to find their lengths
Align the longer list's pointer to match the length of the shorter list
Iterate through both lists simultaneously to find the intersection node
I applied via Campus Placement and was interviewed in Aug 2023. There were 4 interview rounds.
1 hour - Coding question-hard type palindrome type question , 10 MCQs including aptitude, math and paragraph question and finally a RESTAPI question on hackerrank platform
To efficiently manage room bookings and prebookings in a hotel, a priority queue data structure can be implemented.
A priority queue can be used to prioritize room bookings based on check-in dates.
When a customer checks out, the room becomes available and can be assigned to the next customer in the priority queue.
Prebookings can be stored separately and checked against the availability of rooms before assigning them to ...
Minimum 7 races required to find the top 3 fastest horses.
Divide the 25 horses into 5 groups of 5 horses each.
Conduct a race among the horses in each group to determine the fastest horse in each group.
Take the top 2 horses from each group and conduct a race among them to determine the fastest horse overall.
The winner of this race is the fastest horse.
Now, take the second-place horse from the final race and the second-p...
Implementing a sorting algorithm in Java to arrange an array of numbers in ascending order.
Use Arrays.sort() method for simplicity: Example: int[] numbers = {5, 3, 8}; Arrays.sort(numbers); // Result: {3, 5, 8}
Implement Bubble Sort for educational purposes: Iterate through the array, swapping adjacent elements if they are in the wrong order.
Consider Quick Sort for efficiency: Divide the array into sub-arrays and sort t...
Retrieve staff members in departments and departments for staff members using SQL queries.
Query 1: To get all departments for a specific staff member, use a JOIN between Staff and Department tables.
Example: SELECT d.department_name FROM Department d JOIN Staff s ON d.department_id = s.department_id WHERE s.staff_id = 1;
Query 2: To get all staff members for each department, use a JOIN and GROUP BY.
Example: SELECT d.depa...
I appeared for an interview in Sep 2024, where I was asked the following questions.
1 DSA question and mcqs
The minimum area of a square that contains all given points is the square of the maximum distance between any two points.
Calculate the distance between all pairs of points
Find the maximum distance
Square the maximum distance to get the minimum area of the square
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 29 interview experiences
Difficulty level
Duration
based on 85 reviews
Rating in categories
Senior Software Engineer
2.5k
salaries
| ₹19.7 L/yr - ₹36 L/yr |
Principal Consultant
2.2k
salaries
| ₹20 L/yr - ₹34.2 L/yr |
Senior Consultant
2.2k
salaries
| ₹12.8 L/yr - ₹23.5 L/yr |
Senior Member of Technical Staff
1.9k
salaries
| ₹23.8 L/yr - ₹41 L/yr |
Software Developer
1.5k
salaries
| ₹15.3 L/yr - ₹27.4 L/yr |
SAP
MongoDB
Salesforce
IBM