I applied online. The process took 2 months. I interviewed at Goldman Sachs in Oct 2008
Interview
Lengthy online application process with all the standard questions. 1st round of interviews include two general interviews with two interviewers in each. These will be employees at the firm at a variety of levels - all within the division you are applying to. The other 1st round interview is a technical interview based upon a case study. The 2nd round is a further three interviews similar the the 1st round but perhaps more detailed in nature.
Interview questions [1]
Question 1
Have you ever encountered difficulties or frustrations when working within the team you were in at your last place of employment?
I applied online. The process took 1 week. I interviewed at Goldman Sachs (Bangalore Rural) in July 2025
Interview
first round was easy interview was very supportive but round 2 was bit difficult asked me alot of questions and confused me in my answers because of my confidence was low he seems to was not interested in interview and was failed 2nd round.
Interview questions [1]
Question 1
Round 1. Event Emitter, Class in javascript
Round 2. Callback hell, promise , Event loop, Async Await, nth larget element in an array, Heap priority Que, Graph DFS BFS
Technical round: medium difficulty Leetcode questions. Had some variation but the concepts were essentially the same. Technical round: medium difficulty Leetcode questions. Had some variation but the concepts were essentially the same
1)You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.
2)Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.
Interview questions [1]
Question 1
1)You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.
2)Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.