SDE - 1
Goldman Sachs
7 rounds | 10 Coding problems
118 views
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures including stack, queue, linked list, trees, hash maps, graphs, trieTopics like recursion, backtracking, dynamic programmingOOPsOperating System, Computer Networks, DBMSMySQL, MongoDb
Tip

Tip 1 : Practice 20-25 questions on each type of data structure.
Tip 2 : Be thorough with the recent project on which you are working on in current organisation.
Tip 3 : Be prepared with the technologies that you have mentioned in your resume.

Application process
Eligibility: No
Resume tip

Tip 1: Have at least 1 project on your resume with which you are wholly thorough with.
Tip 2: Mention your coding profile like links of GitHub or LeetCode.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 mins
Interview date3 Mar 2022
Problems2
3Sum

#### You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

view more
Problem approach

Two pointer approach

Letter Combinations of a Phone Number

#### Given a string S containing digits from 2 to 9 inclusive. Your task is to find all possible letter combinations that the number could represent.

view more
Problem approach

FIFO Queue

02
Round
Easy
Video Call
Duration60 mins
Interview date10 Mar 2022
Problems1
N Queens

#### You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

view more
Problem approach

Using recursion and backtracking

03
Round
Easy
Video Call
Duration60 mins
Interview date17 Mar 2022
Problems2
Shortest Palindrome

#### You are given a string ‘STR’. Your task is to find the shortest palindrome that can be formed by adding characters in front of ‘STR’.

##### For example:
view more
Problem approach

KMP Algorithm

Remove Duplicates from Sorted Array

#### You are given a sorted integer array' ARR' of size 'N'. You need to remove the duplicates from the array such that each element appears only once. Return the length of this new array.

view more
Problem approach

Two pointer approach

04
Round
Easy
Video Call
Duration60 mins
Interview date24 Mar 2022
Problems1
Debugging question

In this round, they opened up their code base and asked me to figure out the error and fix it.

Problem approach

That was related to streams in java and exception handling.

05
Round
Easy
Video Call
Duration60 mins
Interview date31 Mar 2022
Problems2
Set Matrix Zeros

#### Given an ‘N’ x ‘M’ integer matrix, if an element is 0, set its entire row and column to 0's, and return the matr...

view more
Problem approach

Solved using HashSet

Word Search - l

#### You are given a 2D board(N rows and M columns) of characters and a string “word”. Your task is to check if the ...

view more
Problem approach

Solved using DFS and backtracking

06
Round
Easy
Video Call
Duration60 mins
Interview date31 Mar 2022
Problems1
Basic Hr Questions

1. Why have you used this tech stack?

Problem approach

It revolved around recent projects and technologies used into it.

07
Round
Easy
HR Round
Duration30 mins
Interview date1 Apr 2022
Problems1
Basic HR Questions

Why you are leaving the current organisation?
Why do you want to join Goldman Sachs only?
Discussion regarding compensation and benefits.

Start a Discussion
Similar interview experiences
SDE - 1
5 rounds | 8 problems
Interviewed by Goldman Sachs
15736 views
Associate Analyst
3 rounds | 5 problems
Interviewed by Goldman Sachs
1197 views
Summer Analyst Intern
2 rounds | 2 problems
Interviewed by Goldman Sachs
191 views
Analyst
6 rounds | 12 problems
Interviewed by Goldman Sachs
0 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57333 views