Panda Guru LogoPanda
Guru

Goldman Sachs | Assoiciate |

Round 1

Questions: Hackerrank Test: There are two easy level problems and has 2 hours to solve them, it took me 30 minutes to solve them. I did not remember questions, but they are easy.

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.


Round 2

Questions:

  1. There will be a grid of size N*M which contains coins, find the optimal path to collect the most coins (only allowed north and east).
  2. Given a list of students with their scores in different subjects, find the student with a max average score. Score is a string and it can have negative values also.

They expected to run with some test cases and our code should pass all test cases.

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.


Round 3

Questions:

  1. Maximum Sum Circular Subarray
  2. Given a list of students with their scores in different subjects, find the student with a max average score. Score is a string and it can have negative values also.

They expected to run with some test cases and our code should pass all test cases.

Candidate's Approach

I was able to solve the questions. They asked some questions related to ConcurrentHashMap because I used HashMap in my code. The interview was easy, but I generally code in C++ and here they expected Java.

Interviewer's Feedback

No feedback provided.


Round 4

Questions:

Candidate's Approach

I implemented the Singleton Class and answered their questions on multithreading. I suggested using checksums for data consistency, which led to further questions about implementation and verification.

Interviewer's Feedback

No feedback provided.


Round 5

Questions:

Verdict: Rejected

Candidate's Approach

I wrote some pseudo-code for MongoDB and Kafka, but I couldn't recall the exact code, which seemed to disappoint them.

Interviewer's Feedback

No feedback provided.