Available question text
Related questions
Continue with questions that share topics or the same question type.
- 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.
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
- 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
- Given a graph as an adjacency list that represents a single ring, return all the nodes in the order they appear on the ring, starting from any node and going in either direction.
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
Google
Given a parsed chat log where each message has a username and a word count, return the top N users with the highest total word count, in descending order.
Reported Oct 2026 · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source