I applied through a staffing agency - interviewed at Goldman Sachs in September 2012.
Interview Details –
Referred to job by staffing agency. 1 phone interview + 1 on-site with 4 rounds.
Phone interview focused on resume, questions, data structures, object class, linked list, questions on projects, questions like give me an example when you used 'x' technology or 'y' design pattern - why did you chose it, how did you implement, etc..
Took a long time to schedule on-site. Staffing agent said it's expected of GS - they have a lot of delay when scheduling appointments and said not to worry..
Had on-site at 200 W Street, NY.
From the feel of it, there was a lot of pressure, miscommunication among the employees.
1st round was written test - 5 questions, asking to write code on paper and left alone in conf room for 45 minutes. Questions were expected to be answered in C++ or Java (although the position I applied to was C# - I almost got the impression they had no clue why I was there). The questions were:
1. a) write a program to check to see if an entered string is a palindrome,
b) do the same recursively
c) calculate complexity.
2. Given function: F(0)=1
a) write a program to generate this recursively
b) what is the complexity of this program
3. Output of C or Java program:
C - had charbuf
public class JavaTest
static String StrS = "...";
StringBuffer STB = new StringBuffer("..");
public void method(int i, string str, StringBuffer STB)
str = ..
String Str = ...
StringBuffer STB = new StringBuffer("bonjour");
JavaTest JT = new JavaTest();
4. a) Write a program to reverse a linked list.The method will be passed a pointer to the head of the linked list. Do not create a new linked list.
b) Write complexity of this program.
5. Based on registers - they wanted to see how I would achieve programming objectives with limited space and re-use instructions.
2nd round included being questioned on the answers to above questions for the next 30-45 minutes.
3rd round was :
pure virtual functions, abstract class?, Stack? local data, variables-where do they go? - on process stack, how to declare abstract classes in C++, final class?, how to create final class?-final in java, in C++?polymorphism?, use?, difference in overloading and overriding, all types of joins? how do they work? indexes? how do they work? what is the data structure used to store indexes?-tree
4th round: pretty laid back guy, least fussy and most relaxed of all interviewers. His questions: stack? interface for stack? write pseudocode for stack if stack tracks the min element. Write a pseudocode. Complexity of this program?
5th round: Another stressed-out guy:
linked list? fibonacci series - recursive solution., complexity of this? (nlogn) how to improve? caching results of fib(n) and reusing (O(n)).
indexing? how does it work? if DB has table for employee with fields employee id and employee name, what happens when user types ABC
6th round: Behavioral, HR, overview
Interview Question – How does indexing work in a database? How is it implemented? what happens when user types ABC? View Answers (2)
We bring together people, capital and ideas to produce solutions and results for our clients by playing a number of roles: financial advisor, lender, investor and asset manager. A commitment to integrity, team work and… — Full Overview
Provided by employer [?]
This is the employer's chance to tell you why you should work for them. The information provided is from their perspective.
Your feedback has been sent to the team and we'll look into it.
The difficulty rating is the average interview difficulty rating across all interview candidates.
The interview experience is the percentage of all interview candidates that said their interview experience was positive, neutral, or negative.
Your response will be removed from the review – this cannot be undone.
Simply post an anonymous review for a recent interview experience or current/former employer. Your post is anonymous – and if you're worried someone will be able to identify your review, you can even post without telling us your job title and location. Learn More.
No thanks –