Oracle Software Engineer interview questions

83 Software Engineers have shared notes from their Oracle interviews, with the questions they were asked in each round. That is 95% of the 87 Oracle interview notes on Screna AI.

83 Software Engineer interview notes

Oracle·Software Engineer·Onsite - Multi Round

Jul 2026
Four rounds at Oracle OCI for a senior backend role. The technical bar was pretty consistent across rounds but the last round was a mess, the interviewer kept cutting me off mid-sentence and I never got to finish a single answer. Good prep material here if you're going in.
  • Design a distributed load testing service that can send traffic to a target service and track metrics like requests per second, average latency, and error rate.
  • Implement a delayed task scheduler where a user submits a task ID and a future timestamp, and the system executes the task at that time.
  • Given a binary tree node that includes a parent pointer, find the next node in post-order traversal without restarting from the root.
  • Design and implement a networked key-value store where both keys and values are strings, accessible by clients over the network.

“This one opened the loop and I thought I handled it decently.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jul 2026
Interviewed for an EM role at Oracle and got a classic algorithms question that I thought I was prepared for. Turns out there's more nuance to it than I remembered from college.
  • How would you efficiently sort a bitonic array?

“I knew what a bitonic array was but blanked on the cleanest approach under pressure.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jul 2026
Oracle SWE interview with a greedy algorithm problem. Nothing too wild, but the question had a subtle edge case that could trip you up if you went in thinking it was straightforward.
  • Given an integer n, return the largest number less than or equal to n whose digits are monotone increasing (each digit is less than or equal to the next).

“The greedy approach clicked pretty fast: scan from the right, and whenever you see a digit that's smaller than the one before it, decrement the left digit by 1 and set everything to its right to 9.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jul 2026
Oracle software engineer interview that was basically a resume walkthrough plus a deep project dive. Pretty standard format but the project portion had a lot of layers they expected you to cover.
  • Walk me through your resume in 2 to 3 minutes, focusing on your most recent roles.
  • Pick a project you're proud of and walk me through the problem, your specific contributions, the key technical decisions you made, the measurable impact, any trade-offs, and what you learned. Be ready to go into challenges and what you'd do differently.

“I always fumble the time constraint on this one.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jul 2026
Oracle SWE interview with a sliding window problem. Pretty standard coding round, nothing too surprising.
  • Given a string and a pattern, find the minimum window substring that contains all characters of the pattern.

“Classic sliding window problem.”

View Post

Oracle·Software Engineer·Onsite - Behavioral / Leadership

Jul 2026
Behavioral round at Oracle for a software engineer role. Two questions, both pretty standard but they wanted real examples, not hypotheticals.
  • When you're juggling multiple competing priorities like customer issues, roadmap work, tech debt, and stakeholder requests, how do you decide what gets done first? And how do you communicate the trade-offs to get people aligned?
  • Tell me about a time something broke in production or a project failed. How did you handle it in the moment, limit the damage, keep people informed, and make sure it didn't happen again?

“The alignment part tripped me up more than the prioritization part.”

View Post

Oracle·Software Engineer·Onsite - System Design / Architecture

Jul 2026
System design round at Oracle for a software engineer role. One big open-ended question that basically ate the whole session. Felt like a lot to cover in the time given.
  • Walk through the system design of a recent project you owned. Cover functional and non-functional requirements, high-level architecture including services, data stores, and messaging, and explain how data flows through the system. Also discuss scaling strategies, consistency vs availability trade-offs, schema decisions, performance bottlenecks, failure handling, observability, and why you made the key design choices you did.

“This was basically the whole interview in one prompt.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview that focused on tree problems. The main question was about comparing two N-ary trees, and they pushed pretty hard on both a recursive and iterative solution plus complexity analysis.
  • Given two N-ary trees, write a function to determine if they are identical in structure and node values.
  • Now implement the same tree comparison iteratively, without recursion.
  • What is the time and space complexity of your recursive and iterative solutions?

“Recursive solution came to me pretty fast: both null means true, one null means false, values differ means false, child list lengths differ means false, then recurse on each pair of children.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a graph/scheduling problem that looked straightforward on the surface but had a few wrinkles worth knowing about going in.
  • Given n courses labeled 0 through n-1 and a list of prerequisite pairs, return any valid ordering in which all courses can be completed. Print the final order.

“They threw in a simplifying constraint: each course has at most one direct prerequisite, so the graph is actually a forest rather than a general DAG.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a classic array partitioning problem. Pretty algorithmic, nothing flashy, but the follow-ups pushed harder than I expected.
  • Given an integer array, partition it so all even numbers appear before all odd numbers. You can swap any two elements at any positions. What is the minimum number of swaps needed?
  • How would you modify the approach to produce a stable partition, preserving the original relative order within the even and odd groups?
  • How would you generalize this partitioning logic to work with an arbitrary predicate instead of even/odd?

“Two pointers from opposite ends, left skips past evens, right skips past odds, and when both land on violations you swap and count it.”

View Post