Oracle

Role: SDE

College: Not Specified

Interview Date: 2024

Interview Type: Full-Time

Result: Selected

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: DBMS, Computer Networks (CN), Object-Oriented Programming (OOPs), Operating Systems (OS), SQL, Logical Reasoning, Data Structures and Algorithms (Linked Lists, Binary Search Trees, Anagrams, Minimum Area Rectangle, Ordered Sets)

Experience:

This Oracle SDE interview experience from 2024 involved three rounds.

Round 1: Coding and Aptitude Test. This round consisted of two sections: a coding question and an aptitude test. The test included 50 questions, with one coding problem and multiple-choice questions (MCQs). The MCQs covered core computer science subjects such as DBMS, Computer Networks, Object-Oriented Programming, Operating Systems, and SQL. Additionally, there were a few logical reasoning questions and some coding-related ones. Overall, the MCQs were relatively easy. The coding questions mentioned were "Unique Binary Search Trees" and "Minimum One-Bit Operations to Make Integers Zero" (a friend's question). Over 100 students were selected to proceed to the next round.

Round 2: Technical Interview 1. The first technical interview began with introductions. The interviewer then focused on the candidate's DBMS project, which was explained in detail. After the project discussion, two Data Structures and Algorithms (DSA) questions were asked: "Add Two Numbers Represented by Linked Lists" and "Group Anagrams". Both questions were described as fairly simple. The interviewer was friendly and approachable, and the candidate successfully cleared this round.

Round 3: Technical Interview 2. This round was described as a bit unconventional. The interviewer introduced himself and then presented a scenario involving a large telescope that could see all the stars in the sky. Given the x and y coordinates of all the stars, the candidate was asked to create a minimum-area rectangle that would cover all the stars, with its sides parallel to the x and y axes. The interviewer left for 15 minutes before the candidate could clarify. A solution was provided, but the interviewer found it confusing. Further discussion included the performance of sets and another problem that the candidate solved using an ordered set (PBDS). The interviewer then asked how an ordered set worked internally, which the candidate could not explain in detail. Finally, a simple question was asked: "How to check if a binary tree is a Binary Search Tree (BST)?", which the candidate explained correctly.