Quantitative Developer applicants have rated the interview process at Goldman Sachs with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 60.1% positive. This is according to Glassdoor user ratings.
Candidates applying for Quantitative Developer roles take an average of 8 days to get hired, when considering 6 user submitted interviews for this role. To compare, the hiring process at Goldman Sachs overall takes an average of 33 days.
Common stages of the interview process at Goldman Sachs as a Quantitative Developer according to 6 Glassdoor interviews include:
Phone interview: 38%
One on one interview: 25%
Skills test: 25%
Personality test: 13%
Here are the most commonly searched roles for interview reports -
Two rounds of phone technical interviews. One round used the format of Coderpad, which asked behavior questions and algorithm questions. Another round was just a phone interview but asked algorithm questions too
I applied through a staffing agency. I interviewed at Goldman Sachs
Interview
This was a really weird joke.
Contacted by a headhunter, got a coderpad interview, it went ok and 2 days later I got an invite for an online 5h interview with people from the team in a week and a half. They sent me a schedule and everything.
And here the fun part comes - an hour before the start I got an email that it got cancelled. No, not rescheduled, cancelled. I heard they don't really respect their employees, but hey, that's something new!
Interview questions [1]
Question 1
Two rather easy Coderpad problems, then an option for a third problem.
I applied online. I interviewed at Goldman Sachs (New York, NY) in Mar 2015
Interview
45 min phone interview with 15-20 min questions. From mathematical proof to basic computer science terminology explanation and pseudo - coding. The guy on the phone just kept asking questions It more looked like testing your reaction under pressure.
Interview questions [1]
Question 1
Prove there are infinitely many prime numbers; check if two linked list is a cycle; two sum;