Oracle OCI IC3 Pre-screening Interview Experience
Question Details
I completed a pre-screening for OCI in mid-September. Although the portal status remains at "Interview and Selection," I have not yet received any further communication.
Problem Statement The task
Full Details
I completed a pre-screening for OCI in mid-September. Although the portal status remains at "Interview and Selection," I have not yet received any further communication.
Problem Statement The task was to process a stream of stock data containing a Stock Name, Price, and Timestamp. The objective was to implement a function to identify the top $K$ most expensive stocks within the last $T$ minutes, adhering to the following rules: * $K$ is variable and differs for each function call. * If a stock reappears in the stream, the previous price is invalidated (only the latest entry counts).
Solution Approach I implemented a heap-based solution where tuples of (price, time, stock_name) were pushed onto a heap. The logic included specific checks to ensure that only the data corresponding to the latest timestamp for a given stock was considered valid during retrieval.
About This Question
This is a reported interview question from a oracle interview for a swe role (junior level) reported in 2025.
It covers the following topics: Heap .