goldman sachs logo
Goldman Sachs· Analyst

Goldman Sachs | Analyst | Bangalore | September 2021 | Reject

Result
Rejected
Location
bangalore
Experience
2 years
Posted
28 Sept 2021
309 reads

Summary

I interviewed for an Analyst position at Goldman Sachs in Bangalore with 2 years of prior IT experience. Despite clearing the online assessment and two coder pad rounds, I was unfortunately rejected after the first technical round of the Super day.

How it went

I was initially contacted by a recruiter on LinkedIn regarding an Analyst position at Goldman Sachs in Bangalore. With 2 years of previous IT experience in an investment bank, I proceeded with their hiring process. The first step was an online assessment, followed by two separate coder pad rounds, each an hour long and conducted face-to-face with an analyst. After successfully navigating these, I was scheduled for a Super day, which was planned to consist of three rounds: two technical interviews and one with a hiring manager. Regrettably, my journey ended there as I was rejected after completing only the first technical round of the Super day.

Questions asked (9)

  1. 01

    Climbing Steps with Specific Jumps

    Data Structures & Algorithms

    Find the number of ways to climb steps if you can only take 2, 4, or 6 steps at a time. This is a variation of the classic climbing stairs problem.

  2. 02

    Remove Continuous Duplicate Characters

    Data Structures & Algorithms

    Given a string, remove characters that occur continuously for a specified length. This removal process should be repeated until no more characters can be removed further.

  3. 03

    Run-Length Encoding (String Compression)

    Data Structures & Algorithms · Easy

    Convert a string like 'aaabbccc' to 'a3b2c3', where consecutive identical characters are replaced by the character followed by its count.

  4. 04

    Max Path Sum in 2D Grid (Up/Right)

    Data Structures & Algorithms

    Given a 2D grid where each cell has some value, find the largest accumulated value you can get by starting from the bottom-left cell and ending at the top-right. You are only allowed to move up or right.

  5. 05

    Binary Tree Zigzag Level Order Traversal

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and so on. Alternate between).

    Open the problem
  6. 06

    Best Time to Buy and Sell Stock (One Transaction)

    Data Structures & Algorithms · Easy

    You are given an array prices where prices[i] is the price of a given stock on the i-th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve. If you cannot achieve any profit, return 0.

    Open the problem
  7. 07

    Minimum Insertions to Sort an Array

    Data Structures & Algorithms

    Given an unsorted array, determine the minimum number of insertions required to make the array sorted. This is a variation related to the longest increasing subsequence problem.

    Open the problem
  8. 08

    Gas Station Problem (Circular Tour)

    Data Structures & Algorithms · Medium

    There are N gas stations along a circular route, where the amount of gas at station i is available[i]. You have a car with an unlimited gas tank and it costs required[i] of gas to travel from station i to station i + 1. You start the trip with an empty tank at one of the gas stations. Return the starting gas station's index if you can travel around the circuit once, otherwise return -1. If there exists a solution, it is guaranteed to be unique.

  9. 09

    Implement LRU Cache

    Data Structures & Algorithms · Medium

    Design and implement a Least Recently Used (LRU) cache. It should support get and put operations, both with O(1) average time complexity. Explain how to handle a cache miss.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Goldman Sachs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!