## Microsoft Interview Question for Software Developers

Country: United States
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
0
of 0 vote

We just need to maintain k largest elements seen so far. We can use a min-heap for this:
* Load the huge array by blocks that fit in memory
* If a number in the block is greater or equal to the min element in the heap or if the heap is empty, add it to the heap and remove the min element if the number of elements in the heap became k+1
* When we are done processing the array, the min element in the heap is the result

Comment hidden because of low score. Click to expand.
0

Perfect solution.

Comment hidden because of low score. Click to expand.
0

can we also do it with the max heap I guess?

Comment hidden because of low score. Click to expand.
0

what happen if we cant maintian k+1 elements min heap in RAM ?

Comment hidden because of low score. Click to expand.
0
of 0 vote

One of the best approaches is to use the max heap, we can insert all the elements of the array or the large size block and then we can pop out the first k elements to get the kth largest element in the largest size block

Implementation:

#include<bits/stdc++.h>
using namespace std;
int findrepeatedelement(int arr[], int n, int k){
priority_queue<int> p;
for(int i = 0; i < n; i++)
p.push(arr[i]);
while(--k)
p.pop();
return p.top();
}
int main(){
int arr[] = {10, 5, 1, 30, 20};
cout<<findrepeatedelement(arr, 5, 3);
return 0;
}

Comment hidden because of low score. Click to expand.
0
of 0 vote

what happen if we have 50 GB of data and 1 GB of RAM and lets say we want Kth largest element and for maintaining K+1 elements min heap we need more than 1 GB of space?
In this case u cant just maintain min heap in RAM !

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.