Oracle

Round 1 - Theoretical questions related to Java. Coding question: Create a class for an n-ary tree with weights for each node and write the code to calculate the minimum weight from root to leaf. SQL question: Involving table joins and sorting on s

1st round: Basic DSA questions, Java OOP, Collection Framework, Design Patterns - Get the second minimum element from an array 2nd round: Easy to Medium DSA - Find the missing element from an array - isPalindrome (recursive) 3rd round: SQL and a bi

Had an initial 3-hour 1:1 interview which included a lot of algorithm questions, problem-solving, and descriptive questions in Java. This was continued by a 45-minute PL/SQL interview. Was called later for another set of interviews, which had questi