Oracle - SE4 - Feb 2026
Summary
I interviewed for an SE4 role at Oracle in February 2026, completing six stages that covered coding, system design, and extensive behavioral questions, and I ultimately received an offer.
Full Experience
Stage 1: Max profit using single buy and sell, bottom view of the tree (approach), find the minimum number of processes allocated, given page urls (with schemaName, host, port), design youtube/netflix - consider ww delivery, Given three bags one with gold, silver and mix, and all of them are wrongly labelled, how will you correctly map, given a situation to pick one item from one bag. Behaviour questions like why job switch, give a situation when you had to take a decision given very less pointers, open to work with a frontend, backend, etc. Stage 2: Design a remote browser isolation system for enterprises, spoke about authn, authz, data streaming, gateways, ratelimiting, virtual nodes, edge server, etc. a=30, b=40. Swap a and b without a third variable. Stage 3: Behavioral questions, projects. Then two coding questions:
- To reduce the size of the messages transmitted over the internet, a compression algorithm encodes consecutive repeating characters in a string. Your task is to compress the given string using this rule. Scan the string from left to right and group consecutive identical characters. If a character appears once, add just the character to the output. If a character appears more than once, add in a row, add the character followed by the number of consecutive occurrences. given input: aaaaabbbccca. o/p a2b3a2b2c3a
- given a sorted array list of integers, remove duplicates in place such that each element appears no more than k times. Expected time is big O of n time, big O of 1 space complexity. Stage 4: (Key interviewer / HM) One hour full of behaviour questions. Given a scenario how will you respond - conflict management, handling tough people, why oracle, questions about optimising my pet project using AI, etc. Stage 5: (Bartender): Behavioural questions, why oracle, complex project explanations, etc. Stage 6: 1. Coding Question 1 Rate Limiter / Dropped Requests
Given a sorted list of request timestamps, implement a function to return the number of dropped requests based on these constraints:
Maximum 3 requests per second Maximum 20 requests per 10 seconds Maximum 60 requests per 60 seconds Dropped requests still count toward future rate limits.
Follow-up:
Explain different approaches from naive to optimal. Analyze time and space complexity. 2. System Design Question Design a Recommendation System for a Large-Scale E-commerce Platform
Design a recommendation system based on users' browsing history.
Interview Questions (9)
Max Profit with Single Transaction
Given an array of stock prices where the i-th element represents the price of a given stock on day i, find the maximum profit you can achieve by making exactly one buy and one sell transaction. You must buy before you sell.
Bottom View of a Binary Tree
Given a binary tree, return the bottom view of the tree. The bottom view contains the nodes that are visible when the tree is viewed from the bottom. For each horizontal distance from the root, the lowest node (i.e., the one with the greatest depth) should be included.
Three Bags Puzzle
You have three bags: one contains only gold coins, one contains only silver coins, and the third contains a mix of gold and silver. All bags are incorrectly labeled. By picking one item from a single bag, determine the correct labeling for all three bags.
Swap Two Variables Without a Temporary Variable
Given two integer variables a = 30 and b = 40, swap their values without using a third (temporary) variable.
String Compression
Compress a string by encoding consecutive repeating characters. Scan the string from left to right, grouping identical characters. If a character appears once, output the character. If it appears more than once, output the character followed by the count of consecutive occurrences. Example: input "aaaaabbbccca" → output "a5b3c3a".
Remove Duplicates with At Most K Occurrences
Given a sorted list of integers, remove duplicates in place such that each distinct element appears no more than k times. The algorithm should run in O(n) time and O(1) extra space.
Rate Limiter / Dropped Requests
Given a sorted list of request timestamps (in seconds), implement a function that returns the number of dropped requests based on the following limits:
- Maximum 3 requests per second
- Maximum 20 requests per 10 seconds
- Maximum 60 requests per 60 seconds Dropped requests still count toward future rate limits.
Explain naive to optimal approaches and analyze time/space complexity.
Remote Browser Isolation System Design
Design a remote browser isolation system for enterprises. Discuss authentication, authorization, data streaming, gateways, rate limiting, virtual nodes, edge servers, and any other relevant components.
Recommendation System for Large-Scale E-commerce
Design a recommendation system for a large-scale e-commerce platform that suggests products to users based on their browsing history and other possible signals.