Available question text
Given an n x n matrix where each row and each column is sorted in ascending order, return the kth smallest element in the matrix. Walk through both the min-heap approach and the binary-search-on-value approach, compare their time and space complexity, and discuss which one you'd prefer for very large matrices that don't fit in memory.
Related questions
Continue with questions that share topics or the same question type.
- Given two strings s and t, return the minimum window substring of s that contains every character of t including duplicates, or an empty string if no such window exists. Walk through the sliding-window approach using two pointers and a character-frequency hashmap, analyze the O(|s| + |t|) time complexity, and discuss how to adapt it when t contains characters not present in s or when s arrives as a stream that cannot be fully buffered.
Other questions
- DP problem: You are given several service options. For each option i, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth.
Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible.
Return the maximum number of requests that can be handled.
Other questions
- Zero matrix problem, where you are given a matrix and need to set an entire row and column to zero whenever a zero appears in the matrix.
Other questions
- 1. Design Interview: Design a game leaderboard with top K results. Assume there is an online game that's taking place, and you need to only build the dashboard that everyone is viewing.
2. Behavioral: They try to gauge your level here - so try to aim for an L5 - or explicitly state so.
3. Merge k sorted lists
4. Schedule matches between two sets of players where no two players have a re-match (play only once against each other)
Other questions
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
OpenAI
Given an n x n matrix where each row and each column is sorted in ascending order, return the kth smallest element in the matrix. Walk through both the min-heap approach and the binary-search-on-value approach, compare their time and space complexity, and discuss which one you'd prefer for very large matrices that don't fit in memory.
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source