Associate | Goldman Sachs | Bangalore | Offer
Anonymous User
3103

First Round (Coderpad) (1 hr)

  1. Easy/Medium level grid based DP question.
  2. Find root of the largest tree in a forest. Input is given as child parent mappings.

Second Round (Zoom) (1 hr)

  1. Asked questions on differences b/w linked list and array list. Asked in-depth questions on internal implementations of HashMap, TreeMap. Asked questions on concurrent list implementations in java. Asked to code a thread safe linked list (not entire code..just insert and delete operations… focus was on handling synchronisation).
  2. Asked to code for a trading related problem (question eventually boils down to implementation where we need to maintain concurrent sliding window of trade objects….. again focus was on handling synchronisation)

Third Round (Zoom) (1 hr)

  1. Questions on Garbage Collectors, programming patterns while developing low latency trading systems, reading heap dump, analysis of cpu and memory issues, debugging trading systems, reasons to minimise garbage collection while developing low latency systems, programming practices useful to minimise garbage collection.

Fourth Round (Zoom) (45 min)

  1. Discussion on previous work experience.

Fifth Round (Zoom) (45 min)

  1. Asked to design an in-memory Map in a basic assembly like language which can run on embedded systems which has support of primitive data types and structs. Questions on supporting references(addresses of memory location) as keys and also multiple data types like (int, float, string, structs) as keys of Map. Focus was on high performant get operation. (Only Approach and trade offs… no coding)

Sixth Round (Zoom)(>1 hour)

  1. Questions on few oops concepts.
  2. Problem which can be solved using quick select algorithm.(only approach… no coding).
  3. Problem which can be solved using bucket sort. (Only approach…no coding).
  4. First System Design question in gr**king system design course.

Seventh Round (Zoom) (30 mins)

  1. Questions on volatile keyword(how compiler reorders code with and without volatile keyword), Approaches to find topological order of a graph, past work experience, why change, why Goldman Sachs.
Comments (3)