AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Goldman Sachs Analyst Interview Questions and Answers for Freshers
13 Interview questions
Binary Search Tree is a data structure where each node has at most two children, with left child less than parent and right child greater.
Nodes have at most two children - left and right
Left child is less than parent, right child is greater
Allows for efficient searching, insertion, and deletion of elements
The problem involves finding an element in a matrix that is sorted both row-wise and column-wise.
Start from the top-right corner of the matrix
Compare the target element with the current element
If the target is smaller, move left; if larger, move down
Repeat until the target is found or the matrix boundaries are crossed
Options are financial contracts that give the buyer the right, but not the obligation, to buy or sell an underlying asset at a predetermined price.
Options can be used for hedging or speculation
There are two types of options: call options and put options
Call options give the buyer the right to buy the underlying asset at a predetermined price, while put options give the buyer the right to sell the underlying asset ...
Expected number of tosses of a fair coin to get 3 consecutive heads.
The probability of getting 3 consecutive heads is 1/8
The expected number of tosses to get 3 consecutive heads is 14
This can be calculated using the formula E(X) = 2^k + 2^(k-1) + 2^(k-2) + ... + 2^2 + 2^1 + 2^0, where k is the number of consecutive heads required
Number of ways to jump n stairs if a person can climb 1 or 2 stairs.
Use dynamic programming to solve the problem.
The number of ways to jump n stairs is equal to the sum of ways to jump n-1 stairs and ways to jump n-2 stairs.
Base cases: if n=0, return 1 and if n=1, return 1.
An LRU cache can be made using a doubly linked list and a hash map.
Create a doubly linked list to store the cache items.
Create a hash map to store the key-value pairs.
When a new item is added, check if the cache is full. If it is, remove the least recently used item from the linked list and hash map.
When an item is accessed, move it to the front of the linked list.
When an item is removed, remove it from both the l...
Searching an element in a sorted 2D matrix
Start from the top-right corner or bottom-left corner
Compare the target element with the current element
Move left or down if the target is smaller or move right or up if the target is larger
Efficient algorithms for calculating Fibonacci's sequence
Use dynamic programming to avoid redundant calculations
Implement matrix exponentiation to reduce time complexity to O(log n)
Use memoization to store previously calculated values
Iterative approach using constant space complexity
Binet's formula for direct calculation of nth Fibonacci number
A call option is a financial contract that gives the buyer the right, but not the obligation, to buy an underlying asset at a predetermined price within a specified time period.
Call options are bought by investors who believe that the price of the underlying asset will rise in the future.
The buyer of a call option pays a premium to the seller for the right to buy the asset at a predetermined price, known as the st...
Compute working days using given functions f, g, and h.
To compute the 3rd working day, apply function g three times to function f.
To compute the 2nd working day of the previous month, apply function h to function f, then apply function g twice.
To compute the 4th working day of the next month, apply function g four times to function f.
Goldman Sachs Analyst Interview Experiences for Freshers
16 interviews found
Anonymous
On their BlueJ platform with 2 questions asked with optimizations needed
(1 Question)
- Q1. Explain what is Binary Search Tree
- Ans.
Binary Search Tree is a data structure where each node has at most two children, with left child less than parent and right child greater.
Nodes have at most two children - left and right
Left child is less than parent, right child is greater
Allows for efficient searching, insertion, and deletion of elements
Skills evaluated in this interview
I applied via Company Website and was interviewed before Jun 2022. There were 5 interview rounds.
Aptitude question related to trigonometry and logical reasoning
2 coding question based on dp and binary search
(2 Questions)
- Q1. Maximum sum subarray
- Q2. Sliding window maximum
- Ans.
Find the maximum value in each sliding window of size k in an array.
Use a deque to store indices of array elements.
Maintain the deque in decreasing order of values.
Remove indices that are out of the current window.
The front of the deque always contains the index of the maximum element for the current window.
Example: For array [1,3,-1,-3,5,3,6,7] and k=3, output is [3,3,5,5,6,7].
(1 Question)
- Q1. Basic hr questions
Interview Preparation Tips
Sagar Khadka
I applied via Recruitment Consultant and was interviewed in Dec 2021. There were 4 interview rounds.
Interview Questionnaire
5 Questions
- Q1. What is Asset Management
- Ans.
Asset management is the process of managing and optimizing a company's assets to maximize their value and minimize risk.
Asset management involves identifying, tracking, and evaluating assets
It includes developing strategies to optimize asset performance and minimize risk
Examples of assets that can be managed include financial investments, real estate, and equipment
Asset management can be done in-house or outsourced to ...
- Q2. What is private equity
- Q3. What is custodian banking
- Ans.
Custodian banking involves holding and safeguarding financial assets on behalf of clients.
Custodian banks provide services such as asset safekeeping, settlement of trades, and corporate actions processing.
They also offer reporting and analytics to clients on their holdings and transactions.
Examples of custodian banks include State Street, BNY Mellon, and J.P. Morgan.
Custodian banking is important for institutional inve...
- Q4. Difference between hedge funds and private equity
- Ans.
Hedge funds are actively managed investment funds that use various strategies to generate high returns, while private equity firms invest in private companies and aim to increase their value.
Hedge funds are open to a wider range of investors than private equity funds
Hedge funds use leverage to increase returns, while private equity firms use debt to finance acquisitions
Hedge funds have a shorter investment horizon than...
- Q5. Situational based questions
Interview Preparation Tips
And importantly don't ever lie, they know everything.
Be yourself.
Selected
I applied via Campus Placement and was interviewed before Dec 2022. There were 6 interview rounds.
There were 3 coding questions with medium difficulty level.
Good knowledge in logical reasoning and mathematics (especially probability) is required.
2 array based questions
1 array and 1 linked list based questions were asked
(1 Question)
- Q1. Logical reasoning and some general interview questions were asked.
Interview Preparation Tips
- Data Structures
- Java
- Mathematics
- React
- Spring Boot
I applied via Company Website and was interviewed in Jan 2021. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Searching and Sorting
- Q2. If You have an infinite array then how many ways to sort it and also tell the complexities
- Ans.
There are infinite ways to sort an infinite array with varying complexities.
Sorting algorithms like QuickSort, MergeSort, HeapSort, etc. can be used to sort the array.
The time complexity of sorting algorithms varies from O(n log n) to O(n^2).
The space complexity also varies depending on the algorithm used.
Sorting an infinite array is not practical, so it is usually done in chunks or using parallel processing.
The sortin...
- Q3. About projects
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview before Oct 2020.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
The round was divided into 5 parts.
1st part - 2 easy coding questions
2nd part - 7 MCQs
3rd part - 8 MCQs
4th part - 1 hard coding question
5th part - 2 ethical based questions
- Q1.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the order of keys in the linked list whenever a key is acc...
- Q2.
Maximum Subarray Sum Problem Statement
Given an array
ARRconsisting ofNintegers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.Example of Sub...
- Ans.
The goal is to find the maximum sum of a non-empty contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider edge cases like all negative numbers in the array.
Example: For input [1, -3, 4, -2, -1, 6], the maximum subarray sum is 7 (subarray [4, -2, -1, 6]).
- Q3.
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size
N * Mwhere each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only... - Ans.
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Calculate the path length by counting the number of 1s in the path.
Return -1 if no valid path exists.
Interview Preparation Tips
Tip 1 : For Goldman Sachs, puzzles are a must.
Tip 2 : Competitive Programming is also necessary for most job interviews.
Tip 3 : Practise mock interviews among your friends.
Tip 1 : Make your resume crisp and clear.
Tip 2 : Have at least two projects on your resume.
Tip 3 : You can take the help of someone to verify any grammatical mistakes and the formation of sentences.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
It was difficult aptitude test. One need to be well versed in aptitude and coding ( any programming language).
(1 Question)
- Q1. I don't know i didn't pass aptitude test
Interview Preparation Tips
Interview Questionnaire
8 Questions
- Q1. He explained my what is call value and put value in finance and asked me to plot it so that user maker maximum profit
- Q2. Find the magic number in an sorted array. magic number is the one whose value and index position is same
- Ans.
Find the magic number in a sorted array where value and index are same.
Iterate through the array and check if the value and index are same
If found, return the value
If not found, return -1
- Q3. Given a 2d matrix sorted row and column wise, search an element
- Q4. Design a newspaper subscription system
- Ans.
Design a newspaper subscription system
Create a user registration system
Allow users to select subscription plan and payment method
Provide options for delivery frequency and start/end dates
Send reminders for subscription renewal
Allow users to modify or cancel subscription
Track subscription history and payment records
- Q5. A person can climb 1 or 2 stairs. Find the number of ways to jump n stairs
- Ans.
Number of ways to jump n stairs if a person can climb 1 or 2 stairs.
Use dynamic programming to solve the problem.
The number of ways to jump n stairs is equal to the sum of ways to jump n-1 stairs and ways to jump n-2 stairs.
Base cases: if n=0, return 1 and if n=1, return 1.
- Q6. How will you mane a LRU Cache
- Ans.
An LRU cache can be made using a doubly linked list and a hash map.
Create a doubly linked list to store the cache items.
Create a hash map to store the key-value pairs.
When a new item is added, check if the cache is full. If it is, remove the least recently used item from the linked list and hash map.
When an item is accessed, move it to the front of the linked list.
When an item is removed, remove it from both the linked...
- Q7. Suppose you and I are playing a dice game. The one who get the lesser number looses the games. The dice has n sides. If I start the game, what is the probablity of you winning?
- Ans.
Probability of winning a dice game where the one with lesser number wins.
The probability of winning depends on the number of sides on the dice.
If the dice has an odd number of sides, the probability of winning is higher for the second player.
If the dice has an even number of sides, the probability of winning is equal for both players.
- Q8. Given 3 functions, f which gives the first day of the current month, g gives the next working day and h gives the previous working day, conpute the 3rd working day? Compute the 2nd working day of the previ...
- Ans.
Compute working days using given functions f, g, and h.
To compute the 3rd working day, apply function g three times to function f.
To compute the 2nd working day of the previous month, apply function h to function f, then apply function g twice.
To compute the 4th working day of the next month, apply function g four times to function f.
Interview Preparation Tips
Experience: There were 30 questions divided into 3 sections(Computer Science fundamentals, Mathematics and Machine learning) each containing 10 questions. Each question was of 3 points with the negative marking of 1 mark. 60 students were shortlisted from this round.
2nd paper consisted of 3 questions in each section. Each section was of 30 points with each question of different weightage.
Tips: Time is more that sufficient. Focus on only one section but try to excel in that
Round: Technical Interview
Experience: Interviewers are very friendly and helped my if I got stuck anywhere
General Tips: Try to cover geeks for geeks as much as you can. It will help you a lot
Skills: Basics Of Machine Learning, Design Engineering, Probabiity, Algorithmic Approach To Problem Solving
College Name: IIT Kharagpur
Motivation: Highly relevant work to my interests
Skills evaluated in this interview
Srijith Rajagopalan
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Interview Questionnaire
22 Questions
- Q1. Tell me about yourself?
- Ans.
I am a highly motivated individual with a passion for learning and a strong work ethic.
I have a degree in computer science and have worked as a software developer for 3 years.
I am proficient in multiple programming languages including Java, Python, and C++.
I am a quick learner and enjoy taking on new challenges.
In my free time, I enjoy hiking and playing guitar.
- Q2. Given a biased coin, how do you create an unbiased toss?
- Q3. Once you have done that, what is the expected number of turns you need to wait for getting the first unbiased toss
- Q4. Suppose a man starts at 0, and has to go to 20 on the number line. He can either move in steps of 1 or 2. How many number of ways can he do this? Extending this, if we know the number of ways for going fr...
- Ans.
Count number of ways to reach 20 on number line starting from 0 in steps of 1 or 2. Derive recursive formula for n+1.
Use dynamic programming to count number of ways for each step.
For each step, number of ways is sum of number of ways for previous 1 or 2 steps.
Recursive formula: ways[n+1] = ways[n] + ways[n-1]
- Q5. Have you applied to any PhD programs?
- Ans.
Yes, I have applied to several PhD programs in the past.
I have applied to PhD programs in [specific field] at [specific universities].
I have experience with the application process, including writing research proposals and obtaining letters of recommendation.
I am currently waiting to hear back from the programs I applied to.
- Q6. Given a number line, and we have a rod of length L. We drop the rod on the line, what is the probability that it covers an integer?
- Ans.
Probability of a rod of length L covering an integer on a number line.
The probability depends on the length of the rod and the distance between adjacent integers on the number line.
If the length of the rod is less than the distance between adjacent integers, the probability is zero.
If the length of the rod is greater than or equal to the distance between adjacent integers, the probability is (L - d)/d, where d is the d...
- Q7. Suppose there are N chocolates, and I pick a random one, and eat that chocolate and also everything to the right of it. I then continue this process with the remaining. How many ways are there to do this...
- Ans.
There are (N-1)! ways to eat chocolates from left to right.
The first chocolate can be chosen in N ways, the second in (N-1) ways, and so on.
However, since the order of chocolates eaten matters, we need to divide by the number of ways to order N chocolates, which is N!.
Therefore, the total number of ways to eat chocolates is (N-1)!
For example, if N=4, there are 3! = 6 ways to eat the chocolates.
- Q8. Supposed there is a party, with 9 people, each person wants to give gifts to 3 people and also wants a gift from them. Is this scenario possible? If not, when is this possible? Give me a general case
- Ans.
No, it is not possible for each person to give gifts to 3 people and receive a gift from them in a party of 9 people.
In this scenario, each person would need to receive 3 gifts, which is not possible if there are only 9 people.
This scenario would be possible if there were at least 10 people at the party.
In general, for a party of n people, each person can give gifts to n-1 people and receive gifts from n-1 people.
- Q9. Given a tank with liquid, and there are flows in and out, inflow is U and outflow is Kx, where x is current height of liquid in tank, all needed quantities given, what are the conditions for overflow and s...
- Ans.
Conditions for overflow and steady state in a tank with inflow and outflow
Overflow occurs when the inflow rate is greater than the outflow rate
Steady state is achieved when the inflow rate equals the outflow rate
Overflow can be prevented by adjusting the inflow rate or increasing the outflow rate
Steady state can be maintained by balancing the inflow and outflow rates
- Q10. What are your interests? (Be careful, align the interests to their profile)
- Ans.
I am interested in data analysis, technology, and staying up-to-date with industry trends.
Data analysis and visualization
Machine learning and AI
Technology advancements and innovations
Industry conferences and events
Networking with professionals in the field
- Q11. Given there are 2 kinds of coins spread all over the world, and we start picking coins, what is the expected number of coins to pick, to have both kinds of coins in hand?
- Q12. Given a window of 1 hour, and two friends want to meet, given that the arrival time follows a uniform distribution, what is the probability that they will arrive within ten minutes of one another
- Q13. Grilled me about my internship, (time series modeling) went in depth about why I did this, that, etc. If you have a time series or ML project, they will grill you on it
- Q14. Given we have a (un)biased die, with given probabilities, and we toss it till we get a sum of 100 or more (basically if the sum crosses 100), and we stop. What is the most probable number you will get on ...
- Ans.
The most probable number on the last toss is 6.
The probability of getting a sum of 100 or more is highest when the sum is 99.
The last toss will be made to reach the sum of 100, so the most probable number is the one that will take the sum closest to 100.
The sum of 94 can be achieved by rolling a 6 on the last toss, which is the most probable number.
- Q15. What do you think our team does. (I gathered this information by asking a lot of questions from other interviewers. It helps a lot)
- Q16. What do you know about options?
- Ans.
Options are financial contracts that give the buyer the right, but not the obligation, to buy or sell an underlying asset at a predetermined price.
Options can be used for hedging or speculation
There are two types of options: call options and put options
Call options give the buyer the right to buy the underlying asset at a predetermined price, while put options give the buyer the right to sell the underlying asset at a ...
- Q17. What is a call option? Why are call options bought?
- Ans.
A call option is a financial contract that gives the buyer the right, but not the obligation, to buy an underlying asset at a predetermined price within a specified time period.
Call options are bought by investors who believe that the price of the underlying asset will rise in the future.
The buyer of a call option pays a premium to the seller for the right to buy the asset at a predetermined price, known as the strike ...
- Q18. If I have to buy fuel from you, what option would I buy?
- Ans.
You can buy fuel from us through our fuel card program.
We offer a fuel card program that allows you to purchase fuel from our network of stations.
Our fuel card program offers discounts and rewards for frequent users.
You can easily track your fuel expenses and usage through our online portal.
We also offer customized fuel solutions for businesses and fleets.
Our fuel is high-quality and meets all industry standards.
- Q19. If we increase the volatility of the stock, how does the price of a call option change?
- Ans.
Increasing stock volatility increases the price of a call option.
Higher volatility means higher potential for the stock to move in the option holder's favor, increasing the option's value
The option's delta and gamma will also increase with higher volatility
Example: If a call option on a stock with a strike price of $50 has a premium of $2 when the stock has a volatility of 20%, increasing the volatility to 30% may incr...
- Q20. How do you calculate the price of a call option?
- Ans.
The price of a call option is calculated using the Black-Scholes model which takes into account the underlying asset price, strike price, time to expiration, risk-free interest rate, and volatility.
Determine the current price of the underlying asset
Determine the strike price of the option
Determine the time to expiration of the option
Determine the risk-free interest rate
Determine the volatility of the underlying asset
Pl...
- Q21. Is the price of a barrier option more or less than a normal option?
- Q22. Do you have any questions?
Interview Preparation Tips
Experience: The resume shortlist, I feel, was slightly unfair. They had put a cut-off of 9 for branches outside EE/CS.
Tips: Don't worry, they might not follow this next year. Your resume should have a mix of probability, finance (courses on these are enough, though internships will really help)
They don't care about your PoRs in the interview, but this may matter for the resume shortlist (Assuming it's done fairly) So be sure to include them.
Round: Test
Experience: There were 30 MCQ questions, 10 each on the above mentioned sections. There is no dearth of time, so you can think clearly and solve the question. I found that quant was the hardest of the lot, followed by coding followed by ML.
ML questions will be on SVMs, ANNs, Ensemble learning methods, Hypothesis testing, Feature selection, Model selection etc. the standard topics you can find in "Elements of Statistical Learning" by Hastie, Tibshirani and Friedman.
The coding section was mostly on arrays, data structures (binary tree, mostly), recursion, and one subjective question.
For quant, you need to be really well versed in probability, definite integrals (Not kidding), and other JEE math.
Tips: You'll need to do really well in atleast one of the sections to be shortlisted. Even if you are non CS/EE, (assuming you don't have experience in coding) you can do really well in ML section. Aim for that and prepare in advance. Once you are through to the interview, you just need to give them a reason to hire you. :)
Duration: 2 hours 15 minutes
Total Questions: 30
Round: Technical Interview
Experience: The lady who interviewed me was a chemE graduate from IIT Bombay. She was friendly and willing to help when asked about a problem. Overall, very good interview experience.
Tips: For all interviews, I'll say this. Ask a lot of questions. They are very interested in explaining what they do, and feel free to interrupt them if you don't understand something. Always try to relate what they say to your interest. That way you'll bring new perspective into the interview. And that's very useful, believe me. If they have shortlisted you, they want to hire you. You just have to give them a reason to. Always relate your experiences and your interests with what they do. if you do that, they will find a role for you, somewhere. Do not worry. I was interested in machine learning and I got a finance profile. (They have a team in that profile that does ML)
For quant questions, I would suggest thinking out loud and interacting each step of the way. They care more about your thinking than about the answer. They will point out the errors and you can correct them. Don't worry about silences, as long as you think out loud, it will not be a problem.
Round: Technical Interview
Experience: Again, very friendly interview. The interviewer will lead you on, and assist you if you're facing any difficulty. :) Just be sure to be jovial and interactive.
Tips: Same as above.
Round: Technical Interview
Experience: Very technical, serious interview. I think he was the senior guy. He still helped out a lot.
Tips: Be to the point, he was more interested in the technical knowledge.
Round: Technical Interview
Experience: The final interview I had. He was very helpful, and was very eager to talk about the company and what they do. He had an extensive knowledge of finance, options (obviously). The course on Mathematical Finance by the maths department was very useful. You need to have a good knowledge of options for getting through this.
Tips: Same as the first interview.
Skills: Quant+Math, Problem Solving Abilties, Probabiity, Internship Experience, Finance
College Name: IIT Madras
Piyush Singla
I appeared for an interview in Dec 2016.
Interview Preparation Tips
Experience: For CSE and EE students , CPI was not at all seem to be a criteria for shortlisting and almost all who have a decent profile got shortlisted for the test. However, for other department students they shortlisted above 9 CPI students.
Round: Test
Experience: It was a 2 hour test. It consisted of 3 sections-Quant , Machine Learning and Computer Science . Each section had 10 questions and 45 minutes were allotted for each section.
Being from non-CSE background I attempted only 2 sections ie. Quant and Machine Learning. Machine Learning section was fairly easy this time and almost all questions were standard. If someone has done an introductory course on Machine Learning and basic stats , this section was a cake walk for him. However , attempting quant section required some preparation of solving probability puzzles (computing expectations etc.) ,basic linear algebra and geometry base questions.
Duration: 2 hours
Round: Technical Interview
Experience: I had 2 rounds of interview. Both were technical ones.
In the first interview , they asked some probability puzzles (from 50 challenging problems in probability book) . Since I had completed that book before , I was able to solve them . Then they asked 1-2 algorithm based questions like formulate an efficient algorithm for solving a particular problem. I was not able to solve them completely but tried to give them the overview of y approach. The interviewer didn't seem to be satisfied though. It lasted for around 20-25 minutes.He told me to wait outside . To my surprise, I was called for the 2nd round.
The second went better than the first round. They again asked questions on computing probability , expectations , constructing a Markov Chain for a a given problem etc. Since I had done 1 course in Fiance also , he asked me questions from it also which were quite easy. Then he began asking algorithms and asked me to explain a sorting algorithm and I chose Quick Sort. While explaining it , I got struck at one point but the interviewer was helping me by giving hints and I was able to explain it fully. The second round was quite exhaustive as it went on for around 45-60 minutes.
Skills: Problem Solving Abilties, Mathematical Aptitude, Algorithmic Approach To Problem Solving, Machine Learning, Statistical Method Basics
College Name: IIT Kanpur
Top trending discussions
Goldman Sachs Interview FAQs
Some of the top questions asked at the Goldman Sachs Analyst interview for freshers -
The duration of Goldman Sachs Analyst interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Goldman Sachs Interviews By Designations
- Goldman Sachs Analyst Interview Questions
- Goldman Sachs Associate Interview Questions
- Goldman Sachs Software Developer Intern Interview Questions
- Goldman Sachs Senior Analyst Interview Questions
- Goldman Sachs Software Developer Interview Questions
- Goldman Sachs Financial Analyst Interview Questions
- Goldman Sachs Strategic Anaylst Interview Questions
- Goldman Sachs Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
Top Skills for Goldman Sachs Analyst
Analyst Interview Questions from Similar Companies
Goldman Sachs Analyst Reviews and Ratings
based on 148 reviews
Rating in categories
|
Associate
2.5k
salaries
|  ₹11.1 L/yr - ₹40 L/yr |
|
Analyst
1.9k
salaries
| ₹13.5 L/yr - ₹25 L/yr |
|
Vice President
1.8k
salaries
| ₹19.8 L/yr - ₹75.1 L/yr |
|
Senior Analyst
1.2k
salaries
| ₹5.4 L/yr - ₹19.2 L/yr |
|
Senior Associate
427
salaries
| ₹9.5 L/yr - ₹31.7 L/yr |
JPMorgan Chase & Co.
Morgan Stanley
TCS
Amazon
- Home >
- Interviews >
- Goldman Sachs Interview Questions >
- Goldman Sachs Interview Questions for Fresher
