Intern Interview Questions in London, England | Glassdoor

# Intern Interview Questions in London, England

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

### Intern at Jane Street was asked...

Nov 10, 2015

Jan 5, 2014

Sep 17, 2009
 How many times does the Earth rotate around its own axis while it makes one revolution around the sun?5 AnswersLittle more than 365The earth completes 1 rotation on its own axis approximately every 24hrs The earth completes 1 rotation around the sun approximately every 365 days So the number of rotations on it's own axis after completing 1 rotation around the sun is: 24 rotations per day x 365 days = 8,760 rotations.one time more than the number of days in a yearShow More Responses365. Second response is funny: - The earth completes 1 rotation on its own axis approximately every 24hrs; + I add that one day as 24hrs; - 24 rotations per day.... Well I didn't know we had a 576hrs days :)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.

### Intern at Jane Street was asked...

Feb 11, 2015
 Sum all the odd numbers between 1 to 1004 Answersfirst odd number is 1. sum with second odd number (3) is 4. sum with 3rd (5) is 9 sum with 4th (7) is 16 and so on. this pattern continues right the way up and since there are 50 odd numbers between 1 and 100 the answer is 50^21 sums with 99 to create 100. 3 sums with 97 to create 100 There are 25 of those pairs. So 25*100 = 2500Another approach is that for 1 to 10 the sum is 25 from 11 to 20 the sum is 10*5+25, from 21 to 30 the sums is 20*5+25 and so on. Thus, the final result is 25*10 + 5*(10+20+...+90) = 250 + 5*450 = 2500Show More Responsessum n over odd n from 1 to 100 = sum(2n-1) from n = 1 to 50 = 2*sum(n) -50 = 50(50+1)-50 = 2500

### Intern at Jane Street was asked...

Dec 8, 2017
 We have a tricycle and we are going to travel on it for a thousand miles. We also have two spare tires with us. If you want each of them to be worn the same by the end of the journey, what is minimum number of stops you have to make in order to achieve this?4 Answers4 times3 timesLet a,b,c,d and e denote the different tires. travel a certain amount, x1 with tires a,b and c. Let us keep count of how much each tire has travelled. At this moment, length_travelled(a) = L(a) = x = L(b) = L(c) Now, travel x2 with a,d and e. Keep on travelling like this until each tires' length function has a sum of 3 elements of xi. This requires four stops (15/3=5 and 4 stops equals 5 occasions of travelling) In my case I went for abc ade bce dba cde but the exact order isn't important. So in my case I end up with L(a) = x1 + x2 + x4 L(b) = x1 + x3 + x4 L(c) = x1 + x3 + x5 L(d) = x2 + x4 + x5 L(e) = x2 + x3 + x5. A trivial solution is xi = xi for all i, and since sum of xi = 1000miles, x1 = x2 = x3 =x4 = x5 = 200 miles. If we have any less than 4 stops, when we try to solve the equations we find that some x terms must be 0, which leads to more x terms being 0 and essentially there is no solution except xi = 0 for all xiShow More ResponsesWe can easily establish 3 as an upper bound and then it's not hard to convince ourselves that this is minimal. miles=0: 1,2,3 | 4,5 miles=400: 1,4,5 | 2,3 miles=600: 2,4,5 | 3,1 miles=800: 3,4,5 | 1,2 Only three stops, after 400, 600 and 800 miles. They all are used for 600 miles of the journey.

Mar 31, 2014
 Count the number of bits set in an integer. What is your favorite language and what you don't like about that language.3 AnswersThis question totally caught me off guard because I haven't dealt anything about bit manipulation before>Count the number of bits set in an integer I assume that this questrion suppose to count 1's (1 = bit is set(or enabled)) 1 - enter an integer (for example 2) 2 - put binary form of 2 into a string and count 1's (in C++ you can use a bitset and it's method called count: ... bitset x(number); cout << x.count(); //count number of 1's (bits which set) ...The interviewer probably wanted you to use bit-wise operations. In java you would bit-wise "and" the number with 1 left-shifted by a number i from 0 to 31. This would return zero if the i-th bit is not set, or something other than zero otherwise. public int getBits(int n) { int count=0; for(int i=0;i<31;i++)//bit which we are checking { if(n & (1<

### Intern at World Food Programme was asked...

Mar 10, 2018
 What interests you about the World Food Programme?3 AnswersI have intrest in giving food to people because is what i love doing all the time, and when ever i found my self doing it i gain more joy and happinessWhat interest me about World Food Programme is the high security impose on food items, the humaniterian act especially to the poor and also the fact tha a great percentage of food prices are been reduced thanks to rhe World Food ProgrammeWhat interest me about World Food Programme is the fact that, it is non governmental organisation which provide help to the needy , chek on food security and reduce a great percentage on food prices in every countries.

May 11, 2017