← Back to Directory

Oracle interview notes, page 7 of 9

Large Enterprises

Most of these Oracle write-ups come from Software Engineers (83), then Machine Learning Engineers (2) and Data Scientists (1). The most reported rounds are the technical phone screen (52), the system design round (14), the behavioral / leadership round (12) and the hiring manager screen (3).

87 interview notes · updated Oct 2026

Oracle·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Oracle PM interview with a single case-style prompt about building an enterprise product, framed through the lens of how OpenAI would approach it. Pretty open-ended, which sounds fun until you're actually in it.
  • You are a product manager at OpenAI. How would you design and build an enterprise product?

“Took me a second to figure out what angle they actually wanted here.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a log-parsing problem that looked manageable on the surface but had enough edge cases to keep you on your toes. Fairly standard technical phone screen energy.
  • Given a list of unsorted log entries each containing a user ID, an action (signin or signout), and a timestamp, plus an integer maxTime, find all user IDs that have at least one valid session. A session is valid if a signin is immediately followed by that user's next signout and the elapsed time is within maxTime.

“My first instinct was to just sort everything globally and walk through it, which would've been a mess.”

View Post

Oracle·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Oracle software engineer interview with a behavioral-ish prompt that was more technical than I expected. One question, but it had a lot of layers to it.
  • Walk me through your past projects, then pick one and describe a particularly difficult problem you solved: what made it hard, how you tackled it, and what the outcome was.

“I froze for a second choosing which project to talk about, which probably looked bad.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a data structures question that sounds straightforward until you actually have to think through the edge cases under pressure. One question, design-focused, with a discussion component about trade-offs.
  • Given a continuous stream of user login events, design a data structure that supports two O(1) operations: one to record that a user has logged in (users can log in multiple times), and one to return the earliest-logged-in user who has logged in exactly once. Return null if no such user exists.

“I knew a linked list was involved pretty early but kept second-guessing myself on how to handle the duplicates cleanly.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a robot grid simulation problem. The question sounds deceptively simple but the reasoning behind the answer is what they're really after, not just the code.
  • A robot starts at (0,0) facing North on an infinite grid and executes a sequence of moves ('G' to go forward, 'L' to turn left, 'R' to turn right). The sequence repeats forever. Write a function that returns true if the robot stays within some bounded circle, and justify your reasoning including edge cases.

“I got the base cases fast enough: if after one cycle the robot is back at origin, it loops forever, bounded.”

View Post

Oracle·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Oracle ML engineer interview, got a coding question on sparse matrix multiplication. Pretty focused on efficiency and representation choices rather than just getting the right answer.
  • Implement sparse matrix multiplication for two sparse matrices A (m x k) and B (k x n). Choose a sparse representation, avoid iterating over zeros, and discuss complexity in terms of non-zero counts rather than the dense case.

“The representation choice was actually where I spent most of my time.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a classic greedy/DP problem. Nothing too surprising but it's the kind of question that feels easy until you're actually in it.
  • Given an array of non-negative integers where each element represents the maximum jump length from that position, determine whether you can reach the last index starting from the first.

“I went with the greedy approach, tracking the farthest reachable index as I walked through the array.”

View Post

Oracle·Software Engineer·Hiring Manager Screen

Jun 2026
Casual conversation with a director at Oracle for a software engineer role. Two topics, no coding, just vibes and whether you actually want the job.
  • What's your take on AI and how it's reshaping the industry or your day-to-day work?
  • If we extend you an offer, would you genuinely take it? What makes Oracle the right choice over other companies you're looking at?

“I had some thoughts ready but the conversation went broader than I expected.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a string decoding problem that looks straightforward until you actually try to parse it correctly in linear time. One question, pretty focused, felt more like a coding screen than a full loop.
  • Given an encoded string, decode it into a 26-element integer array representing letter frequencies. Single-digit characters '1'-'9' map to letters a-i, two-digit numbers followed by '#' (like '10#' through '26#') map to letters j-z, and an optional parenthesized count immediately after a letter encoding means that letter repeats that many times. Implement this in O(n).

“The two-digit '#' suffix encoding is what trips you up if you're not careful.”

View Post

Oracle·Software Engineer·Technical Phone Screen

Jun 2026
Oracle SWE interview with a tree problem that sounds easy until you actually have to code it up and explain the complexity properly. Pretty standard technical screen vibe.
  • Given two N-ary trees, write a function to check if they are identical. Two trees are identical if their root values match and their children lists are recursively identical in the same order. Also discuss time and space complexity.

“The recursive solution isn't hard to sketch out but I fumbled a bit explaining the complexity.”

View Post