Question Details
Problem Find the K smallest numbers from a large data stream or array efficiently using a max-heap. Likely LeetCode equivalent LeetCode 703 - Kth Largest Element in a Stream. Tags heap,arrays,sorting,swe
Full Details
🔒
Unlock all MongoDB questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a mongodb interview during the phone round.
It covers the following topics: Arrays, Heap, Coding, Phone .