Given a stream of incoming integers that cannot all be stored in memory, how would you print the largest K numbers at the end of the input?
AnswerBot
2y
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the ...read more
Help your peers!
Add answer anonymously...
Facebook Software Engineer interview questions & answers
A Software Engineer was asked Q. Given an array of Integers, find the length of the Longest Increasing Subsequenc...read more
A Software Engineer was asked Q. Design and implement a data structure for Least Recently Used (LRU) cache. It sh...read more
A Software Engineer was asked Q. Given a number of time slots with start and end times, find a specific time with...read more
Popular interview questions of Software Engineer
A Software Engineer was asked Q1. Given an array of Integers, find the length of the Longest Increasing Subsequenc...read more
A Software Engineer was asked Q2. Design and implement a data structure for Least Recently Used (LRU) cache. It sh...read more
A Software Engineer was asked Q3. Given a number of time slots with start and end times, find a specific time with...read more
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
