Solicité el puesto a través de un captador. Acudí a una entrevista en Goldman Sachs
Entrevista
Initially there was an elimination round, in which they took written test based on C++ (related to virtual functions, pointers). Post that, there was interview round based on data structures. The interviewer tried to give some twist to very general questions, but was expecting same answer without twist. One of the question was "max length sub array having equal number of 0's and 1's". I gave solution using map, but she was expecting solution which doesnt use memory or uses less memory (which is not possible). Another question was run length encoding, given a string "aaaabb" compress to "a4b2", "ab" compress to "a1b1" and to do it inplace. For every question she asked, she said i dont have much time left, you have 5 mins to solve it.
Preguntas de entrevista [1]
Pregunta 1
Given only 1 pointer to the node to be deleted, how would to delete the node?
Acudí a una entrevista en Goldman Sachs (Seattle, WA)
Entrevista
Had Coderpad interview (45 mins), Superday Interview (45mins ,45 mins) virtually. they were DSA , DSA+ System Design. currently waiting for the update. 2 interviewers, were there in each rounds. DSA problems were Optimal approach and find average score
Acudí a una entrevista en Goldman Sachs (Bengaluru)
Entrevista
First round was hackerrank assessment having 2 coding questions. Then after clearing that, the first round of interview had Leetcode Hard question, similar to get the maximum score. I was not able to do it. Interviewer was very nice though
Preguntas de entrevista [1]
Pregunta 1
Leetcode Hard question, similar to get the maximum score
One OA and coding round
I failed at first round since I cannot solve that lc problem, interviewer is from the office out of Japan,
OA is easy, got help with AI you can easily passed it.
Preguntas de entrevista [1]
Pregunta 1
one hard lc question.
4. Median of Two Sorted Arrays