Oracle Application Developer Interview Questions and Answers

Q1. Intersection of linked list
Ans. 
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
Answered by AI
Add your answer

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

Q1. Resume scrutiny about projects and internship
Add your answer
Q2. There N rooms in a hotel so customers will check-in and check-out a rooms simultaneously so which type of data structure you implement and it should be efficient and extension of this prebooking will also ...read more
Ans. 
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 ...read more
Answered by AI
Add your answer
Q3. There are 25 horses in which you need to find out the fastest 3 horses. you can conduct a race among at most 5 horses to find out relative speed. At no point, you can find out the actual speed of the horse...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q4. There is snail which has to climb a ramp of some slope with length of 30ft while climbing the ramp the snail moves 3ft/hour up and simultaneously moves 2ft/hour down so in how much time it will take to cl...read more
Add your answer

Q1. You have given array of numbers in which you need to write an algorithm to sort them (preferably in java)
Ans. 
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...read more
Answered by AI
Add your answer
Q2. SQL-QUERY, There is a department table with department name ,department ID and with staff members ID who are working in department and also there is a Staff members table with staff member name, staff memb...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q3. How do you measure 4 liters with a 5 liters and 3 liters container
Add your answer

Q1. Merge intervals question of leetcode
Add your answer

Q1. Dsa and System design questions
Add your answer
Q2. Dsa and System design questions advanced
Add your answer

1 DSA question and mcqs

Q1. Minimum area of square that contains all the points
Ans. 
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
Answered by AI
Add your answer

One binary search question ( aggressive cow) and one restapi

Q1. Questions on project, LRU cache and Trie
Add your answer

Q1. Hotel booking system design
Ans. 
Design a hotel booking system.
• Create a database to store hotel information, room availability, and bookings.

• Develop a user interface for customers to search and book hotels.

• Implement a payment gateway for secure transactions.

• Include features like room selection, date selection, and guest information.

• Consider implementing a rating and review system for hotels.

• Ensure the system can handle concurrent bookings and prevent ...read more
Answered by AI
Add your answer

Q1. Grinded on projects, development, react concepts, 2 coding questions
Add your answer
Q2. Infix to postfix
Ans. 
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*.
Answered by AI
Add your answer