Oracle runs a decentralised loop: each business unit (OCI, Server Technology, NetSuite, Oracle Financial Services, CGBU, Application Labs) hires on its own rhythm, so round counts range from a single panel conversation to a ten-hour on-campus marathon or a six-round US onsite. Almost every path opens with a timed online assessment that mixes one or two DSA problems with aptitude, verbal and CS-fundamentals MCQs, and distinctively for Oracle, a REST-API call question and at least one SQL query. Interviews then alternate coding with heavy database and OS theory, project and resume grilling, classic logic puzzles, and a closing managerial or HR conversation; senior and OCI roles add high-level design plus behavioural questions anchored to Oracle's stated principles.
These 22 writeups cover software engineering, cloud infrastructure, database and other roles, India-heavy, some US (OCI Seattle). 19 of them were posted under a pseudonym (Reddit, GeeksforGeeks or forum handles), so we could not verify the authors’ identities.
Typical rounds
3.81-6 range
Outcomes shared
11/5offer / not
Most common round
Technical
Sources span
2022 - 2025
Most frequently reported · Past projects(18), Behavioral(16), Arrays & strings(15), Aptitude(14), Data structures & algorithms(14)
Oracle’s official process
Oracle's own engineering-careers blog says the technical loop tests coding, problem-solving and culture fit together. It tells candidates to refresh core CS (arrays, strings, linked lists, trees and BSTs, hash maps, queues, stacks, graphs; sorting, recursion, search, graph/tree algorithms, dynamic programming; big-O analysis), practise on judges such as HackerRank, and expect to solve a problem in the language of their choice and write a test case if time allows. Its interview advice is explicitly process-oriented: ask clarifying questions because problems are deliberately vague, talk through the plan before coding, think out loud and treat it as collaborative, and do not panic about finishing since many problems are open-ended by design. A companion careers page ('Getting Hired at Oracle') covers applications, career gaps and veteran hiring rather than round structure.
A HackerRank test combining aptitude questions, two easy algorithm problems and one question requiring a REST API call.
Covered · Aptitude, Arrays & strings, API design
2
Technical interviewTechnical
Started with a casual introduction, then drilled into inheritance and access modes, the diamond problem and why Java avoids multiple inheritance, plus a rope-and-load style logic puzzle.
Covered · OOP, Puzzles
3
Technical interviewTechnical
A long project-driven round covering REST APIs, IP protocols and the OSI model, normalisation and join types, and virtual memory, ending on software development lifecycle questions tied to the interviewer's DevSecOps team.
Covered · Past projects, API design, Networking, DBMS, Operating systems
4
Director roundHiring manager
Taken by a company vice president: a probability puzzle, a graph-traversal question about detecting a loop, pseudocode for depth-first and breadth-first search, and when denormalisation is preferable to normalisation.
A long theory screen anchored on the candidate's project: joins and indexing, authentication versus authorization, Kafka usage, branching and release workflow, then a deep sweep of Java threading, collections, exception hierarchy, static semantics and design patterns.
Covered · Past projects, SQL, DBMS, Concurrency, OOP, Testing
2
TechnicalTechnical
Two classic coding problems (building a balanced BST from a sorted array, spiral matrix traversal) followed by REST verbs and idempotence, JVM/JDK/JRE distinctions and recursion questions.
Covered · Trees, Arrays & strings, API design, OOP
3
TechnicalTechnical
A stack-based parentheses problem, then an architecture discussion about message-broker choice, container and Kubernetes tooling in the deployment pipeline, autoscaling thresholds and when to prefer asynchronous over synchronous processing.
Covered · Arrays & strings, Scalability, Concurrency, Past projects
4
Hiring managerHiring manager
Mixed behavioural and problem solving: hardest problem solved, a mistake made at work, the burning-rope timing puzzle and a simulation problem counting the minimum chairs needed from an arrival/departure string.
Covered · Puzzles, Arrays & strings, Behavioral
5
Design and processSystem design
High-level design of the candidate's current application, defining REST contracts for a CRUD employee resource, plus how production bugs and deployments are handled on their team.
One hour split between behavioural questions framed around Oracle's principles, REST semantics including PUT versus POST, hash map internals, and a timed cache-implementation coding exercise.
Covered · Behavioral, API design, Data structures & algorithms
2
Loop technicalTechnical
Behavioural questions on company values followed by a half-hour stack-simulation coding problem.
Covered · Behavioral, Data structures & algorithms
3
Loop technicalTechnical
Two more values-based behavioural questions, then a counting problem over an array with duplicates where only distinct pairs summing to a target count.
Covered · Behavioral, Arrays & strings
4
DesignSystem design
Resume-driven technical questioning plus a high-level design of a distributed scheduler; the interviewer signalled that extreme scalability and fault tolerance were not expected at this level.
Covered · Behavioral, System design, Resume deep-dive
5
Hiring managerHiring manager
Entirely behavioural, several questions on company principles plus detailed probing of resume claims.
Covered · Behavioral, Resume deep-dive
6
Final technicalTechnical
Two behavioural questions and a binary-tree ancestor problem where the candidate also had to enumerate their own edge cases.
A short on-site written paper of platform multiple-choice questions plus three easy coding tasks including a singleton, a linked-list insertion and an array transform.
Covered · Domain knowledge, Data structures & algorithms
2
TechnicalTechnical
Project-centred: on-device machine learning, local persistence, data visualisation and multithreading, app and UI lifecycle basics, closed by a string-matrix coding question.
Covered · Past projects, Concurrency, Domain knowledge, Arrays & strings
3
TechnicalTechnical
More resume and platform depth on value versus reference types and threading, plus one medium coding question; the candidate was told to look up anything they had missed between rounds.
Covered · Resume deep-dive, OOP, Concurrency
4
ManagerialHiring manager
A short session with the manager and team lead on projects, motivation for leaving the current employer and interest in the team; Android candidates got a coding question here instead.
Covered · Past projects, Behavioral
5
DirectorFinal
Cultural fit and goal alignment with a director, ending in a compensation conversation; background verification and the offer letter followed over the next month.
Fifteen aptitude, reasoning, comprehension and grammar multiple-choice questions plus two coding problems, one of them a grid dynamic-programming question.
Covered · Aptitude, Dynamic programming
2
TechnicalTechnical
Several array and greedy problems in sequence, then a detailed walk through projects with follow-ups on obstacles encountered and an open-ended question about how a large language model might be built.
The only round, run by two interviewers: thesis and project discussion including web-security topics, a grid connected-components coding problem written and run on a shared judge, a second-highest-salary SQL query solved two ways, then polymorphism, the diamond problem and operating-system basics.
Covered · Past projects, Domain knowledge, Graphs, SQL, OOP, Operating systems
Member of Technical Staff, Server Technology (project intern)
Internship
Received an offer3 rounds
1
Online assessmentOnline assessment
A very long multiple-choice paper spanning algorithms, reasoning, data interpretation, database and operating-system fundamentals and basic English.
Covered · Aptitude, Data structures & algorithms, DBMS, Operating systems
2
TechnicalTechnical
String coding problems that were incrementally made harder (anagrams, then de-duplicating with frequency counts), a discussion of time and space complexity, and an ants-on-a-triangle probability puzzle.
Covered · Arrays & strings, Data structures & algorithms, Puzzles
3
TechnicalTechnical
Half an hour on web architecture and cloud deployment from the candidate's project, then a binary-tree spiral traversal problem.
Held over video with candidates shuffled between virtual rooms: Java version specifics, predicting output of static initialisation order, reversing a string without library calls, a word-matching file program, and a long thread on singleton correctness when it holds a mutable collection.
Covered · OOP, Arrays & strings, Debugging
2
TechnicalTechnical
A shared recursion problem solved live on screen share, plus how to make a collection immutable and how to define equality so duplicate objects collapse in a hash-based set.
Covered · Data structures & algorithms, OOP
3
ManagerialHiring manager
How the candidate plans and executes their day, product discussion and whether they had ever proposed and driven an improvement.
Covered · Behavioral, Past projects
4
HRBehavioral
Compensation discussion plus standard motivation questions.
Resume and internship questions, a short coding task, relational versus document storage trade-offs, data-format comparison, and notably finance-domain questions on how loans and credit cards work.
Project impact and internship role, drawing an entity-relationship diagram for a given scenario, waterfall model and testing terminology, plus career and hobby questions and awareness of Oracle's banking product.
Covered · Past projects, DBMS, Testing, Behavioral
One medium-to-hard dynamic-programming problem, ten aptitude questions and a REST API problem; roughly one in seven candidates advanced.
Covered · Dynamic programming, Aptitude, API design
2
TechnicalTechnical
Simple algorithm implementations written out to check fluency, then a heavy focus on relational queries (joins, ordering, sorting) and theory, closing on the candidate's project.
Covered · SQL, OOP, Past projects
3
Manager and HRHiring manager
Deliberately hard enterprise-Java and database questions the candidate mostly could not answer; the interviewer was testing composure under pressure before easing back to fundamentals and relocation questions.
Aptitude and reasoning plus output-prediction questions across several languages, then two coding tasks: one database query problem and one REST API problem.
Covered · Aptitude, SQL, API design
2
TechnicalTechnical
Around forty minutes: explain and draw the architecture of a project, then scenario-driven query writing plus stored procedures, transactions and functions, with a few scripting questions at the end.
Covered · Past projects, SQL, OOP
3
Managerial and HRHiring manager
Role played in a project, how team conflicts were resolved, and a resourcing-versus-deadline scenario, closing on strengths and weaknesses.
Covered · Behavioral, Conflict handling, Past projects
A 100-minute test on HackerRank: one string coding problem, twenty multiple-choice questions across fundamentals, reasoning and verbal, and a REST API question.
Covered · Arrays & strings, Aptitude, API design
2
TechnicalTechnical
Projects and internship stack, a second-highest-salary query with multiple approaches and dialect awareness, plus two coding problems on arrays and trees and some scripting concepts.
Covered · DBMS, SQL, Arrays & strings, Trees, Past projects
3
TechnicalTechnical
Normalisation anomalies and ACID, an aggregation query over an orders table, identifying and converting a table's normal form with an entity-relationship diagram, then two implementation problems the candidate had to dry run against edge cases.
Covered · DBMS, SQL, Debugging, Testing
4
ManagerialHiring manager
Motivation questions, preference between development and testing, writing test cases for a problem asked in an earlier round, and full architecture walkthrough of a chosen project.
Covered · Behavioral, Testing, Past projects
5
HRBehavioral
A brief closing conversation on relocation, higher-study plans, expectations from the role and hobbies.
Twenty-two questions total: one medium algorithm problem, one REST API problem and the remainder aptitude and English; about one in five eligible students advanced.
Covered · Data structures & algorithms, API design, Aptitude
2
TechnicalTechnical
Introduction and project discussion, then two array problems where the interviewer pushed for failing test cases and optimisation, plus computer-organisation questions.
Covered · Past projects, Arrays & strings, Testing
An on-site two-person panel in Pune that opened with an overview of the unit, then covered authentication methods and token structure, microservices and the client-to-server request path, rate limiting, container orchestration basics, choosing between relational and non-relational stores, one coding problem, one aptitude question and a multi-step aggregation query.
Covered · API design, Scalability, SQL, Data structures & algorithms, Aptitude
Four sections: one classic subsequence coding problem, ten aptitude questions, ten verbal reasoning questions and a REST API call task.
Covered · Dynamic programming, Aptitude, API design
2
TechnicalTechnical
Forty-five minutes: linked-list deletion code, object-oriented paradigms, a language-specific keyword question triggered by the candidate's choice of language, two logic puzzles, then self-description questions backed by a supporting anecdote.
Covered · Data structures & algorithms, OOP, Puzzles, Behavioral
3
TechnicalTechnical
Over an hour built around the candidate's coursework: the layered network model, identifying packets belonging to a session, memory hierarchy and eviction policy theory, and finally implementing insert and evict operations over a fixed-size array simulating memory.
Covered · Networking, Operating systems, Data structures & algorithms
4
Technical and HRHiring manager
Cloud service models and when a cloud platform beats a standalone server, applied to one of the candidate's own repositories, ending with personal and family background questions.
A 100-minute test with one easy-to-medium string problem, twenty aptitude, reasoning and verbal questions, and an API question requiring data extraction and multi-key sorting.
Covered · Arrays & strings, Aptitude, API design
2
TechnicalTechnical
Pen-and-paper on-site round: reconstructing an ordered route from source-destination pairs, designing table relations and cardinalities for a college database, and counting occurrences in a sorted array with a push to reach logarithmic time.
Covered · Graphs, DBMS, Arrays & strings
3
TechnicalTechnical
Two harder problems: computing a square root to fixed precision (with a demand to optimise past brute force) and a shortest-path board-game problem the candidate solved recursively at the whiteboard.
Covered · Data structures & algorithms, Graphs
4
HRBehavioral
No technical content: explaining a project to a non-technical listener, a time the candidate's work went unrecognised, extracurriculars and career ambition.
Run on Oracle's own proctored platform with per-section timers and webcam: verbal ability, coding multiple-choice questions weighted towards tree structures, core CS concepts, and a flowchart-completion section.
Covered · Aptitude, OOP, DBMS, Operating systems, Trees
2
TechnicalTechnical
Forty-five minutes: a primality problem repeatedly optimised, then concurrency terminology, encapsulation with a real-world analogy, a language keyword question, project discussion and exception handling with hints from the interviewer.
Covered · Data structures & algorithms, Concurrency, OOP, Past projects
3
TechnicalTechnical
A constrained string-reversal problem (digits must stay in place) with a follow-up on optimisation, the pillars of object orientation, and machine-learning project questions.
Covered · Arrays & strings, OOP, Past projects
4
HRBehavioral
Half an hour on higher-study plans, favourite subject and preferred engineering area, with a few sorting-complexity questions mixed in and an explanation of team options.
Covered · Behavioral, Data structures & algorithms
Two hours covering one coding problem solved with a priority-queue shortest-path approach, one database query, one REST API task and six algorithm multiple-choice questions.
Covered · Data structures & algorithms, SQL, API design
2
TechnicalTechnical
A short twenty-five minute video round with a single search problem over a sorted array with multiple queries.
Covered · Arrays & strings
3
TechnicalTechnical
A mixed fifty-minute round: one tree path-sum problem solved recursively, questions on memory and pointers, and a numeric puzzle.
Covered · Trees, Operating systems, Puzzles
4
HRBehavioral
Internship and college project discussion plus behavioural prompts about a perspective-changing event and demonstrated leadership.
An hour that began with designing a relational model for a library system, writing queries against that model, then two short coding problems on balanced parentheses and array maxima.
Covered · DBMS, SQL, Arrays & strings
2
TechnicalTechnical
Three coding problems on missing numbers, string reversal and longest common prefix, plus more database theory and a duplicate-row query.
Covered · Arrays & strings, SQL, DBMS
3
TechnicalTechnical
Constant-space duplicate detection, another missing-number variant, and implementing the singleton pattern followed by questions on its behaviour and safety under multiple threads.
A 100-minute test with one easy array problem, one implementation-heavy number-theory problem, and multiple-choice questions on CS fundamentals, cloud infrastructure and reasoning.
Covered · Data structures & algorithms, Aptitude
2
Resume and technical depthTechnical
The longest round: REST practices and token-based auth, transport and application protocol internals, an output-prediction question on inheritance, choosing data stores for three scenarios, consistency across distributed databases, containers versus virtual machines, message brokers, and basic data-structure trade-offs.
Covered · API design, Networking, OOP, DBMS, Scalability, Data structures & algorithms
3
Algorithms and operating systemsTechnical
A fast-paced round on processes versus threads, system calls, critical sections, locks, condition variables and semaphores, followed by three easy coding problems in quick succession.
A durability scenario about surviving server restarts, pushed from log-based recovery towards persistent storage, then a file-parsing coding task and a full least-recently-used cache implementation with an optimisation follow-up.
Covered · System design, DBMS, Data structures & algorithms, Debugging
5
BehaviouralBehavioral
An unscheduled short round on educational background, with the interviewer probing the gap between strong entrance-exam results and an average degree grade.
Oracle runs a decentralised loop: each business unit (OCI, Server Technology, NetSuite, Oracle Financial Services, CGBU, Application Labs) hires on its own rhythm, so round counts range from a single panel conversation to a ten-hour on-campus marathon or a six-round US onsite. Almost every path opens with a timed online assessment that mixes one or two DSA problems with aptitude, verbal and CS-fundamentals MCQs, and distinctively for Oracle, a REST-API call question and at least one SQL query. Interviews then alternate coding with heavy database and OS theory, project and resume grilling, classic logic puzzles, and a closing managerial or HR conversation; senior and OCI roles add high-level design plus behavioural questions anchored to Oracle's stated principles.
What topics does Oracle test in interviews?
Commonly reported topics include Data structures & algorithms, Arrays & strings, Trees, Dynamic programming, SQL, DBMS.
These guides summarize public, first-hand interview experiences shared by candidates. They describe the shape of each loop and the topics that came up, not a leaked question bank, and every experience links back to its original source. Processes change often; treat this as directional prep, not a script.