Goldman Sachs Interview Experience | Oct 2022 (Exp. 0-2 Years)

New update is available. Click here to update.

Goldman Sachs interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Goldman Sachs

4 rounds | 11 Coding problems

Meet Patel

Experienced | Oct 2022

Selected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Algorithms, System design, DBMS, Operating system

Tip

Tip 1 : Practice maximum question
Tip 2 : dry run all code

Application process

Where: Campus

Eligibility: NA

Resume tip

Tip 1 : Do not put false things on resume
Tip 2 : make short resume

Interview rounds

Round

Easy

Online Coding Interview

Duration20 Minutes

Interview date8 Oct 2022

Problems4

1. Technical Question

Conversion method in which users, being used to an old system, continue to use the old system, along with the new system, is

2. Technical Question

The records in a file on magnetic tape

3. Technical Question

If a process fails, most operating system write the error information to a ______

4. Technical Question

The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?

Round

Easy

Online Coding Test

Duration35 Minutes

Interview date11 Oct 2022

Problems3

It was in afternoon and there were 3 members panel.

1. Jump Game

You have been given an array 'ARR' of ‘N’ integers. You have to return the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’.

Try solving now

2. Convert A Given Binary Tree To Doubly Linked List

Given a Binary Tree, convert this binary tree to a Doubly Linked List.

A Binary Tree (BT) is a data structure in which each node has at most two children.

Problem approach

first read complete statement of problem, First i did in-order traversal, doing in-order traversal, while doing previously visited node in a variable, For every visited node, make it next to the previous and set previous of this node as previous.

Try solving now

3. Maximum Sum Of Nodes

You have been given a binary tree with an integer value associated to each node. You are supposed to choose a subset of these nodes s...

Try solving now

Round

Easy

Online Coding Test

Duration40 minutes

Interview date13 Oct 2022

Problems3

It was happened at 4 PM on 13th October.

1. Search In The Array

You are given two arrays ‘arr’ of size ‘n’ and ‘queries’ of size ‘q’. For each element ‘q’ in the array 'queries', your task is to find the sum of all elements in the array ‘arr’ which ...

Try solving now

2. Python Questions

I was given code on python threading concept.

Problem approach

I used threading.main_thread() function to get the main thread object. but i exactly didn't remember how to use correctly so this question didn't go well.

3. Reverse A Doubly Linked List

You are given a doubly-linked list of size 'N', consisting of positive integers. Now your task is to reverse it and return the head of the modified list.

Note:

Problem approach

I did first Traverse the whole Linked List and keeping the node’s data into the stack and did pop to element to out of stack and update doubly linked list. but i faced time complexity error and i did much struggle to solve this

Try solving now

Round

Easy

HR Round

Duration20 Minutes

Interview date14 Oct 2022

Problems1

1. Basic HR Questions

Tell me about yourself.
In five years, where do you see yourself?
salary discussion

Was this interview experience helpful?