Goldman Sachs | Tech Analyst | Bengaluru | 2021 | Off-Campus | [Offer]
Sumukh Bhardwaj
6440
Goldman SachsIndiaInterview

Status: New Graduate
Position: Tech Analyst at Goldman Sachs
Location: Bengaluru, India
Date: April 2021
Experience: Internship at JPMorgan Chase & Co.

I applied through the company’s career portal, applications for their Engineering Campus Hiring Program(EHCP) opened on January 20, 2021, and closed on February 8, 2021.

Round 1: Aptitude Test [20th Feb, 90 Min]

  • Received the link for the Aptitude test on 19th Feb. The test was scheduled to be on 20th Feb.
  • The test was conducted on the Hackerrank platform, it was divided into 6 sections having a total of 66 questions with an overall time limit of 90 minutes, test was proctored.
  • Marking Scheme was +5/-2.
  • The sections were:
    image

I solved around 45 questions. I would suggest attempting only easy questions, there were many problems which I was able to solve in 1-2 min while some problems were very tough so try to leave such questions.

Round 2: Technical Test [21th Mar, 135 Min]

image

  • First Problem in the coding section was something similar as below:

    Given 2N words each of length N. We have to arrange all the words in a matrix of size N * N such    that all the words can be read in the crossword matrix  (horizontally/vertically). Also, find the lexicographically smallest arrangement if many are possible:

Example: 
Input:
N = 3
{abc, bfj, cgk, ade, dfg, ejk}

Output:
abc
dfg
ejk

  • The Second Problem in the coding section was related to String and Hashing.

    30 min were alloted to the coding section. I was only able to solve the second problem.

  • MCQs from CSE core were easy I was able to solve all of them.

  • Aptitude section was the toughest, I was able to solve only 1 question out of 8.

  • Advance Coding Section: The problem was related to Graphs. I solved it with a greedy approach however, there was some problem with the test cases.

    There are N people some of them are friends. A person having more number of friends is more popular. In case many people have same number of friends, the person having more popular friends is most popular among them.
You have to distribute T tickets, to most popular people. Each person has different ticket requirement. You have to print the list of people chosen to give the tickets. In case of tie, choose person with lower index.
Constraints: N <= 500, T <= 500.

  • The Last section had two behavioral type subjective questions.

Round 3: Technical Interview 1 [22 Apr, 20-25 Min]

  • Discussion about the Projects and Internship.
  • Given an array of Integers of size N, find the maximum product of N-1 numbers.
  • Left view of Binary Tree
  • Some questions from OS & DBMS.

I explained and coded two approaches for the 1st problem (one with O(N) space and other having O(1)). The second problem is a standard problem, coded it as well

Round 4: Technical Interview 2 [22 Apr, 25-30 Min]

Explained and coded 1st one using Greedy approach and rest three using DP.

[27 Apr]: Received email regarding my selection :). The toughest part was to get the Interview call, interviews were not that tough.

Comments (7)