Oracle Application Developer Interview Questions, Process, and Tips

Some apti ques and 2 coding ques

Asked 2 dsa medium ques

Dsa and oop, cn, be confident

Q1. Sum 2 linkedlists in efficient way
Ans. 
Use iterative approach to traverse both linked lists and sum corresponding nodes while keeping track of carry.
• Iterate through both linked lists simultaneously

• Sum corresponding nodes and carry from previous sum

• Create a new linked list to store the sum
Answered by AI
Add your answer

Q1. Basic Hr Questions
Add your answer

Q1. Question 1:- Two Sum Question 2:- Three Sum Question 3:- Anagram in String
Add your answer

Q1. Largest element in window size K
Ans. 
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.
Answered by AI
Add your answer
Q2. Design Tic Tac Toe
Ans. 
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
Answered by AI
Add your answer
Q3. Sql query using joins
Ans. 
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
Answered by AI
Add your answer

Q1. Design circular doubly linked list with all operations.
Ans. 
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
Answered by AI
Add your answer
Q2. Discussion on past projects, toughest problem solved till now.
Add your answer
Q3. Different types of searching and sorting algo discussion.
Ans. 
Searching and sorting algorithms are essential in programming for efficiently organizing and retrieving data.
• Searching algorithms: linear search, binary search, depth-first search, breadth-first search

• Sorting algorithms: bubble sort, selection sort, insertion sort, merge sort, quick sort

• Examples: Searching for a specific item in a list, sorting a list of numbers in ascending order
Answered by AI
Add your answer

1 coding question on binary search
1 rest API question
15 English And Aptitude mcq

Q1. Project, trie, lru cache
Add your answer

Q1. System design question
Add your answer

Q1. Projects, Reactjs, infix to postfix code
Add your answer