# 790

Manager Intern interview questions shared by candidates

## Top Interview Questions

Sort: Relevance|Popular|Date
Product Manager Intern was asked...September 17, 2009

### How many times does the Earth rotate around its own axis while it makes one revolution around the sun?

one time more than the number of days in a year

Little more than 365

While it makes 365 complete rotations around the sun, to answer the question being asked, the answer would have to be that the earth is constantly rotating around its own axis. Less

### Write a program to print out the first n primes.

Can you explain your logic? I tried your program in C++, and it even prints 21 and 27 as prime numbers. This is my code, where fmod is a function that calculated the modulus result of 2 decimals (double). int main(){ int n; cin&gt;&gt;n; if(n==0){ return 0; } if(n&gt;=1){ cout1){ if(fmod(x,sqrt(x))!=0){ cout&lt; Less

The key in generic questions like this, is to make sure to cover the fundamentals. There's usually a back-and-forth with the interviewer. Might be worth doing a mock interview with one of the Microsoft Program Manager Intern experts on Prepfully? Really helps to get some real-world practice and guidance. prepfully.com/practice-interviews Less

public static void printNPrimes(int n){ if(n==0){ return; } if(n&gt;1){ System.out.println(2); int x=3; while(n&gt;0){ if(x%Math.sqrt(x)!=0){ System.out.println(x); } x=x+2; n--; } } } Less

### You have an array of red balls and blue balls. Sort them in linear time and constant space so that all the red balls are in the front, and all the blue balls in the back.

Set one pointer at the beginning of the array, another at the end of the array. Check both pointers. If the first pointer meets red ball, move to the next one and check again, until it meets blue ball. Then another pointer, if it meets blue ball, move to previous ball, until it meets red ball. Now, switch two balls, and move to next/previous ball respectively. Continue doing this till two pointers meet. Less

//red = 0, blue = 1 public static void sortBalls(int[] balls) { if(balls == null) return; int blueIndex = 0; int redIndex = balls.length - 1; while(blueIndex = redIndex) break; swap(balls, blueIndex, redIndex); } System.out.println(Arrays.toString(balls)); } public static int findNextFromIndex(int[] arr, int index, int target) { while(index = 0) { if(arr[index] == target) break; index--; } return index; } public static void swap(int[] arr, int a, int b) { int temp = arr[a]; arr[a] = arr[b]; arr[b] = temp; } Less

Simply count the balls and alter the array - probably the simplest approach but it solves it in O(n) time and O(1) space using the given array. public static int[] Balls_Sorter(int[] balls) { int red_balls = 0; int blue_balls = 0; for (int i = 0; i &lt; balls.length; i++) { if (balls[i] == 0) // red ball red_balls++; else blue_balls++; } for (int i = 0; i &lt; red_balls; i++) { balls[i] = 0; } for (int i = red_balls; i &lt; balls.length; i++) { balls[i] = 1; } return (balls); } Less

### Tell me about the side project written in resume

My side project was site engineer job role in handle all manpower and visite time to time site and check working process..then report with senior. Less

Tt

Tt

### Tell me about a time you were a leader and were unsuccessful.

I talked about a time when my teammates and I all had different styles, and two teammates always fought, and the emotional tension prevented us from doing our best work. This question is hard because as a leader you don't really want to admit you've failed. Less

### design an algorithm to find every word in a 4*4 box (like words with friends)

every letter has a row and column index and you must iterate thru all sixteen letters, and use recursion to increase the length of the word being searched until it reaches 16 (max because no letters can be used twice in the same word). Less

### Tell me about yourself. How to solve a difficult situation?

I did well.

Hello, as an MS employee I have created an interview prep guide for Microsoft interviews, based on my and my colleagues' recent interview experiences. The guide has questions you should expect along with our answers that got us into Microsoft. You can find it here: interviewjoy.com/services/interview-process-details/microsoft-program-product-manager-interview-questions-answers-details-ms/ (please do not forget to also look at the reviews at the bottom of that page). Thanks and good luck! Ryan Less

### Tell me something about yourself

There's a lot of elements to typically cover in these questions, clarifications, scoping, making sure you're answering the actual question the interviewer is looking for you to answer, etc. Could be worth doing a mock interview with one of the Prepfully Microsoft Program Manager Intern experts... they've worked in the role so they clearly know how to get through the interview. prepfully.com/practice-interviews Less

Hello, as an MS employee I have created an interview prep guide for Microsoft interviews, based on my and my colleagues' recent interview experiences. The guide has questions you should expect along with our answers that got us into Microsoft. You can find it here: interviewjoy.com/services/interview-process-details/microsoft-program-product-manager-interview-questions-answers-details-ms/ (please do not forget to also look at the reviews at the bottom of that page). Thanks and good luck! Ryan Less

### Explain recursion to a 3 year old

Recursion is like a stem on broccoli. Breaking off each stem is simply reducing the whole by using smaller parts of itself. Less

Hello, as an MS employee I have created an interview prep guide for Microsoft interviews, based on my and my colleagues' recent interview experiences. The guide has questions you should expect along with our answers that got us into Microsoft. You can find it here: interviewjoy.com/services/interview-process-details/microsoft-program-product-manager-interview-questions-answers-details-ms/ (please do not forget to also look at the reviews at the bottom of that page). Thanks and good luck! Ryan Less