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

New update is available. Click here to update.

Analyst

Goldman Sachs

6 rounds | 12 Coding problems

Anonymous

Experienced | Feb 2022

Selected

0 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 3 months

Topics: DSA, Java(oops), DBMS, Spring, Hibernate.

Tip

Tip 1 : Be confident and try to communicate with the interviewer.
Tip 2 : Practice all the coding concepts.

Application process

Where: Naukri

Eligibility: Experience of 1yr was required in java development

Resume tip

Tip 1 : Have projects related to the skills mentioned in the job description.
Tip 2 : Be perfect with the things that you put on resume. If you feel not confident enough remove them from resume.

Interview rounds

Round

Medium

Online Coding Test

Duration120 minutes

Interview date19 Feb 2022

Problems2

Balanced parentheses

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Problem approach

Tip 1 : Read the problem statement carefully before starting to code.

Try solving now

Compress the String

Write a program to do basic string compression. For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.

E...

Try solving now

Round

Medium

Face to Face

Duration60 minutes

Interview date9 Mar 2022

Problems2

Sort 0 1

You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution ...

Try solving now

First non repeating character

Problem approach

This can be solved using maps or by taking extra array(storing frequencies).

Try solving now

Round

Medium

Face to Face

Duration60 minutes

Interview date25 Mar 2022

Problems3

Bubble Sort

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

Try solving now

Maximum Path Sum

You are given an n-ary tree consisting of ‘N’ nodes. Your task is to return the maximum sum of the path from the root to the leaf node.

For example:

Problem approach

I have solved this problem through recursion. I have discussed my approach with the interviewer and this discussion was good as it went on for 20minutes. He asked me all the edge case scenarios to check my code covers them or not. I have explained him all his cases and he satisfied.

Try solving now

Level order traversal

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:

For...

Problem approach

I was asked to code this question fast as we were running out of time. I have codes this in short time as I was aware of tree traversals. I have solved this using the height concept of tree.

Try solving now

Round

Medium

Face to Face

Duration60 minutes

Interview date25 Mar 2022

Problems3

Regular Expression Match

Given a string ‘str’ and a string ‘pat’. The string s has some wildcard characters i.e ‘?’ and ‘*’.

If any character is a ‘?’ we can replace that character with any other character. 

If a char...

Problem approach

I solved it with the help of frequency. Extra array was taken and stored all the frequencies and solved it.

Try solving now

Best Time to Buy and Sell Stock III

You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You ca...

Problem approach

Can go through above link. My solution is also similar to the one in link.

Try solving now

Puzzle Question

There are 9 boxes and 36 balls. Can we arrange odd number of balls in every box?

Round

Medium

Face to Face

Duration40 minutes

Interview date25 Mar 2022

Problems1

Minimum Cost Tree From Leaf Nodes

Given an array/list ‘AR...

Try solving now

Round

Medium

Face to Face

Duration60 minutes

Interview date25 Mar 2022

Problems1

OOPS

All the oops concepts were asked. All the collection frameworks were asked and asked me to explain how hashmap works(algorithm). Thread questions were asked and I have no work experience in multi threading and I told the interviewer same and he didn't ask any from multi threading.

Problem approach

Tip 1 : Be thorough with all the oops concepts and examples.
Tip 2 : Don't mention any word which you don't know as your next question can be on the word that you said.