Intitially they had an aptitude test whih was very tough as they were a lot of questions and very leittle time. There were about 15 questions and about 40 minitues and the questions were mainly testing aptitude skills and also some of them were technical based on C/ C++ .Due to the acute shortage of time could not solve the most of the questions
Domande di colloquio [1]
Domanda 1
There were many tough C/C++ questions based on pointers
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.