oracle

A recruiter messaged me on LinkedIn, I shared my resume, and got invited a week later. The interviewer began by explaining the agenda and how the round would proceed. He then gave a short introduction about himself: he works on Oracle Health, on a p

Education: Tier 3 Years of Experience: 4.5 YOE Previous Company: Fired From startup Current Comp: 35L All fixedRole: Senior Member of Technical Staff (SDE-3) Comp: 42L (Base) Variable: 10% Benifits: Standard Oracle Benefit RSUs: $90K Split in 4 years

I had a 4-round interview process. The interview focused mainly on DSA, HLD/System Design, and behavioral questions.Round 1 — TechnicalThe round started with a DSA question: Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit h

Recruiter reached out through linkedin and scheduled an interview after a weekRound 1 - DSAGiven n houses numbered from 0 to n-1, arranged in a straight line.You are given an array infected containing the houses that are initially infected on Day 0.E

Construct an N-ary Tree from Balanced ParenthesesI recently encountered this interview problem for oracle IC3 interview:Given a balanced-parentheses string, construct and return the root of an N-ary tree. Each matching () represents a node, and paren

YOE: 4 years Role: Backend + Data SMTS at Oracle HealthRound 1 - Screening There were a huge number of URL access logs, and I was asked to determine the top K URLs overall and the top K URLs accessed in the last 24 hours. Given that the data was huge

Sharing my recent Oracle interview experience. The process consisted of 5 rounds:Round 1 – Technical + DSA Questions based on my experience, including CI/CD and Idempotency LeetCode-style Cheapest Flights Within K Stops I explained the approach and w

My Oracle Interview Experience (July 2026) : Round 1

Interview Questions I Got1. Maximum of Minimums of Every WindowGiven an array A of size n and an integer x: Consider every continuous subarray of length x. Find the minimum element in each window. Return the maximum among all those minimums. Example:

Elimination Round Given an array and an integer k, find the top k most frequent elements. If two elements have the same frequency, the larger element should appear first.Questions about Java collections, PriorityQueue, HashMap, etc.Deep dive into pro

Round 1 : Project Discussion, DSA round DSA : From a list, find first missing positive integer Leetcode Given two very large files (>1GB) containing integers, cant be stored in-memory, find the intersection set of the two files. The numbers are sorte