Oracle Apps Campus Placement - September 9th

Round 1:

• Aptitude questions
• Coding questions
• Logical questions
• Analytical questions

Round 2:

Paper coding. Everyone received a different question. There was no elimination in this round.

Round 3 (Technical Round - TR):

10 people were selected for this round. The interviewers were friendly. This round focused on the questions from the previous round. They asked about how you approached them, the logic used, potential optimizations, etc. Other questions covered puzzles, DBMS concepts, SQL queries, and Java.

Out of 10 people, only 3 were selected for the next round.

Round 4:

This round was difficult, focusing entirely on programming. Dynamic Programming (DP) problems, Data Structure (DS) algorithms, etc., were asked.

1. Sort the array such that even numbers are in ascending order and odd numbers are in descending order.

2. Given 'n' number of cards out of 52 playing cards, sort them according to color and value.

3. Given a 4x4 matrix containing characters, and a word, check if all characters of the given word are present in the matrix.

4. Given a long string of numbers, like 99100102103104016, find the missing number (e.g., 105). The numbers can be of 1, 2, 3, or any length. For example: 1234568, 1112131416, 9101113, or anything else. Other variations also exist.

5. On an 8x8 chessboard containing only soldiers at different places, soldiers can move up, down, left, or right. Two soldiers are considered connected if they are in positions reachable by soldier movement. Find the maximum connected component.

6. Given shuffled cards, sort them.