Intern Interview Questions | Glassdoor

# Intern Interview Questions

From retail to finance to medicine, every industry needs interns to provide additional support and assistance. Interview questions will vary greatly depending on the industry and role you are looking for. Expect to answer questions about how you work on teams and provide examples of any relevant work experience. To ace your interview, make sure to research the particular position you are applying for.

## Top Interview Questions

Sort: RelevancePopular Date

Mar 12, 2012
 If i roll two dice and multiply the two outcomes, what is the probability of a perfect square?6 Answers2/9 I think1/6 - just the probablity that the numbers on the die are the sameTotal Outcomes = 36 Perfect square= 4 or 9 Odds of getting 4 are 3/36 Odds of getting 9 are 4/36 Probability of landing perfect square= 7/36 = 0.19Show More Responses2/9 is correct. 6 combinations that are the same on both plus 1,4 and 4,1 -> 8/36 = 2/9 ic is talking about the sum, which is not what's asked1,4,9,16,25,36 1-1 rolls 1 (1 combo) 1-4 (2 combos) and 2-2 (1 combo) 3-3, 4-4, 5-5, 6-6 roll a combo each So the answer is 8/36 which reduces to 2/92/9

Mar 2, 2010
 What is the chance that at least two people were born on the same day of the week if there are 3 people in the room?6 Answers~89.8%incorrect. 1-364/365*363/365 = 1-.9918 = .0082...something like this for 2 people, for 2+ add in the chance of 3 of 3. So first guy then gets 365/365 choices, next two get 1/365Also incorrect... They are asking if they were born the same day of the week not the exact same day as Chase alluded to. In this case the easiest way to do the problem is 1- probability that no one was born on the same day. 1-(1)(6/7)(5/7)+ 19/49 or 38.78%Show More ResponsesMy bad =19/49Or you can calculate it directly: The chance of SELECTED two people(but not three) that are born on the same day is 1* 1/7 - 1/7*1/7 =6/49 Now we have 3 chooses 2 = 3 possible pairs, so the probability that any PAIR(but not all three) that are born on the same day is 3* 6/49 = 18/49. However, since the question asks "at least 2", we will need to add the possibility that all three are born at the same day, which is 1/7 * 1/7 = 1/49. So the final result is 18/49 + 1/49 = 19/49 This obviously is a worse way of calculating it, but it's an alternative for some people who wants to think "straight".1-(7/7*6/7*5/7) = 19/49 = 0.39 # 1 minus the opportunities that all 3 people were born in different day of the week.

Oct 12, 2010
 What is the smallest number divisible by 225 that consists of all 1s and 0s?7 Answers11111111100Two facts to note are: 1) Multiplies of 225 end in 00 25 50 75 2) A number is divisible by 9 if the digits sum to 9. Only those multiples ending in 00 could have only 1's and 0's. So, the smallest digit we can multiply 225 by to get 00 at the end is 4. That is, 225*4=900. Now, we want to find the smallest multiple of 900 that contains only 1's and 0's. Let us first focus on 9 and then tack on the 00 after. The smallest multple of 9 with only 1's and 0's is 111111111. This is a consquence of the fact that the digits must sum to 9. Now, we tack on the 00 at the end and obtain 11111111100.^^^^^^WRONG 1111111110. Think of 225 as (5)^2(9). So this number must end in a 0 to be divisible by 5. Since every number that 5 divides ends in a 5 or 0, that number is also divisible by 5. Since a number divisible by 9 must have the digits sum to a number divisible by 9, then all we need is 9 1's and a 0 on the end for 1111111110.Show More Responses1111111110 / 225 = 4938271.6I fail to understand the above answers. Shouldn't it be 225 or 2250. 225/225 =1 and 2250/225 =10. Both these numbers contain just 1's and 0's :PThe above answers seem too complicated/not explained at all. First, notice that 225 = 25 * 9. (1) A number is divisible by 9 iff the sum of its digits is divisible by 9 => we must have 9 1's in our number. (2) A number is divisible by 25 iff the last two digits are divisible by 25 => our last two digits must be 0's. Putting (1) and (2) together, our number is 11111111100.1000-100

Mar 31, 2012
 Implement integer division without using / or %. Questions about running time. Can you do it faster?6 AnswersOptimal running time: O(log n)Binary searchHere's an implementation that works -- any ideas on how to make it go faster? public static void divide_without_slash_or_mod(int num, int divisor) { int factor = 0; int remainder = num; System.out.println("Number = " + num + " divisor = " + divisor); while(remainder >= divisor) { remainder -= divisor; factor++; } System.out.println(" remainder = " + remainder + " factor = " + factor ); }Show More ResponsesHere's an implementation that works -- any ideas on how to make it go faster? public static void divide_without_slash_or_mod(int num, int divisor) { int factor = 0; int remainder = num; System.out.println("Number = " + num + " divisor = " + divisor); while(remainder >= divisor) { remainder -= divisor; factor++; } System.out.println(" remainder = " + remainder + " factor = " + factor ); }D(Divisor), N(Divident) low = 0, high = INT_MAX/D while(low N) high = mid - 1; else low = mid + 1; } return -1; //No divisorHere is the Java implementation of implementing division with O(log n) time complexity (actually, this solution is using divide operator). public static void divide(int dividend, int divisor) { int mid, low = 0, high = Integer.MAX_VALUE / divisor; while(low dividend) { high = mid-1; } else { low = mid +1; } } }

Nov 8, 2010

Apr 14, 2012

### Software Engineering Intern at Palantir Technologies was asked...

Apr 16, 2012
 Say you have a single-column table of entries of variable size. Implement this table to also contain methods to lengthen one cell, cut a cell shorter, and to return which cell we're pointing at if given a certain distance from the beginning of the table. All methods need to be fast (assume a single-column table with many many entries).6 AnswersOne way to do this is to use the doubly linked list. Assuming lengthening and cutting short a cell happens only at the end of the table, then both operations can be done easily and quickly on a D.L.List. Not sure what the interviewer meant by distance from beginning of the table... like number of bytes from the beginning of the table and he wants the cell number?For example, if each cell has length 5, and the user clicks on 13 from the top, then you need to let the user know he has clicked on cell 3. This operation needs to be fast.The search function needs to be doable in less than linear time, and so do inserts and deletesShow More Responsesbinary indexed treeslink list of link listsAn dynamically allocated array that can be resized..

Apr 16, 2012