Initially, there was an elimination round consisting of a written test based on C++. This test covered topics such as virtual functions and pointers.
Following that, there was an interview round focused on data structures.
The interviewer attempted to introduce twists to very general questions, yet expected the standard answer without the added complexity.
One of the questions was: "Find the maximum length subarray with an equal number of 0s and 1s." I provided a solution using a map, but the interviewer was looking for a solution that used minimal or no extra memory, which is not practically feasible for this problem.
Another question involved run-length encoding. Given a string like "aaaabb," the goal was to compress it to "a4b2," and "ab" to "a1b1," with the constraint of doing it in-place.
For every question, the interviewer stated, "I don't have much time left; you have 5 minutes to solve it."
Given only one pointer to the node to be deleted, how would you delete the node?
The following metrics were computed from 35 interview experiences for the Goldman Sachs Software Developer role in India.
Goldman Sachs's interview process for their Software Developer roles in India is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Goldman Sachs's Software Developer interview process in India.