Oracle - SE4 - Feb 2026

656
Jul 29, 2026
  • 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.

Comments (4)