It was great. They wanted to know the person I am, not just by looking at my Resume and cover letter, but also the outward attitude with how one treats the interviewer. Other than that, they went into specific banking related questions on the project operations side of business, client services and brokerage themes
Domande di colloquio [1]
Domanda 1
Prior experiences in the field of economics and finance.
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.