Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Goldman Sachs (New York, NY) nel mese di gen 2010
Colloquio
The interview process was very drawn-out. First I had a phone interview, next I was invited to come and interview on site – I met with 4 people that day, after that I was invited for another in person interview – once again I met with 4 people. Then there was a week during which I’ve received no communication from the HR, however the following week I received an invitation for one more, in-person interview. I declined, since I’ve already received and accepted an offer from a different company during the previous week.
Except for the sheer number of times I had to go back, I had mostly pleasant experience interviewing. All, except one person, were very professional, polite, and seemed like a good group of people to work with. They all asked at least one “analytical” question, but not the ones like “how do you move the building” or “how many elephants are in the country” – their questions were tricky, but you could reason through them; they’ve also asked me about the projects I’ve worked with and some technology related questions.
Domande di colloquio [1]
Domanda 1
what's the difference between dynamic_cast, static_cast
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Goldman Sachs (Bangalore Rural) nel mese di lug 2025
Colloquio
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.
Domande di colloquio [1]
Domanda 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
Ho sostenuto un colloquio presso Goldman Sachs (Hong Kong)
Colloquio
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
Ho sostenuto un colloquio presso Goldman Sachs (Dallas, TX)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
