Goldman Sachs London office interview-Java Post

First round

Phone interview, while on the code pad to do the problem, while the interviewer to explain his ideas while writing code.

First question: Given an int, returns true if it is power of 10, otherwise false.

Recursion can be easily solved.

Second question: Given an array and an integer s, returns all the pairs of integers that are added equal to s in the array.

I originally used HashMap to save S-a[i] and then iterate through the array to find all the pairs of integers. Later, after the interviewer's tip, hashset can solve the problem.

Second round

Onsite Interview

First round: Two interviewers give a test paper, the main topic is to see the ability to analyze and solve problems. There are 10 tasks, a computer, a computer can only do one task at a time and can not be stopped at the beginning, the first question to find out how many programs can run. Second question if all of the tasks must be executed, how to schedule all the task timeout results to be the least combined. The first two asked me to spend a long time, the answer is not very good, so timed out did not see the third question.

Round two: An interviewer two algorithm questions

First question: Find a string with the most consecutive repetition of the letter and the number of consecutive times.

Question two: reverse a LinkedList

is a very simple topic, write pseudo-code on paper and let the interviewer understand the idea of the line.

Third round: should be and management interview, but the same day as if they production out a fault let me go straight home, if the first two rounds before the third round of phone calls.

Overall feeling I onsite play not good, also really have not seen analytical questions this topic, so the result should not be very good.

Goldman Sachs London office interview-Java Post