AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Goldman Sachs Software Analyst Interview Questions, Process, and Tips
Top Goldman Sachs Software Analyst Interview Questions and Answers
- Q1. Climbing the Leaderboard Problem Statement In a game leaderboard, scores determine rankings where the highest score gets rank 1. Players with identical scores share the ...read more
- Q2. Design a HashSet Create a HashSet data structure without using any built-in hash table libraries. Functions Description: 1) Constructor: Initializes the data members as ...read more
- Q3. Fenwick Tree Problem Statement You are provided with an array/list ARR consisting of 'N' integers, along with 'Q' queries. Each query can be of one of the following two ...read more
Goldman Sachs Software Analyst Interview Experiences
5 interviews found
Anonymous
(5 Questions)
- Q1. Difference between SQL and NoSQL
- Ans.
SQL is a traditional relational database management system, while NoSQL is a non-relational database system.
SQL is structured, uses tables with predefined schema, and is good for complex queries.
NoSQL is unstructured, uses collections or documents, and is good for large amounts of data with simple queries.
SQL is ACID compliant, ensuring data integrity, while NoSQL is BASE (Basically Available, Soft state, Eventually co...
- Q2. Reverse a linked list recursively
- Ans.
Reverse a linked list recursively by swapping pointers
Start by checking if the current node is null or the next node is null
If so, return the current node as it is the new head of the reversed list
Otherwise, recursively call the function on the next node and swap pointers
- Q3. Implement a min stack
- Ans.
A min stack is a stack data structure that supports the usual push and pop operations, along with an additional operation to retrieve the minimum element in constant time.
Create a stack to store the elements and another stack to store the minimum values encountered so far.
When pushing an element, check if it is smaller than the current minimum. If so, push it onto the minimum stack.
When popping an element, check if it ...
- Q4. Implement two stacks in a single array
- Ans.
Implement two stacks in a single array using two different approaches
Divide the array into two halves and use one half for each stack
Use two pointers, one for each stack, and move them towards each other as elements are pushed or popped
Consider edge cases like stack overflow and underflow
- Q5. Was asked to write an sql query involing group by and joins
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This round was held in the evening at 6 o'clock on Hackerrank. It had coding questions: easy, medium, and hard level and MCQ's ( 1 minute for each MCQ). Negative marking was also there.
- Q1.
Word Search Problem Statement
Given a two-dimensional grid of size
N x Mconsisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.The 'WORD' can b...
- Q2.
Climbing the Leaderboard Problem Statement
In a game leaderboard, scores determine rankings where the highest score gets rank 1. Players with identical scores share the same rank, followed by the next ran...
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.
- Q1.
Flatten the Multi-Level Linked List Problem
You are provided with a multi-level linked list consisting of 'N' nodes. Each node contains a 'next' and 'child' pointer that may point to another node. Your ta...
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.
- Q1.
Design a HashSet
Create a HashSet data structure without using any built-in hash table libraries.
Functions Description:
1) Constructor: Initializes the data members as required. 2) add(value): Inserts...
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
It was online HR+Technical Round .
- Q1.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
Interview Preparation Tips
Tip 1 : It is important to practice coding consistently because it is what enables you to solve interview-questions in the stipulated time. But before this, it is even important to have a clear understanding of all the data-structures, so that they can be easily implemented as and when required to solve a problem. It is also mandatory to have a clear understanding of the time and space complexities of algorithms because this is what you are judged upon in real interviews. Good intuition and a good approach to solve a problem is what really helps to crack the interview of such companies.
Tip 2 : They do not judge you upon the number of internships you have done or the number of projects you have made. A single ,good-quality project is sufficient, provided you have in-depth knowledge about it. What matters to them is how efficient learner you are, how good is your problem-solving skill and also how confident you are with your answers.
Tip 3 : Practise topic -wise questions, participate in lots of coding contests, watch lots of Youtube solutions even after you could solve a question, because you may find a different approach that is efficient than yours and watching video solutions is always a better option than just reading the solution , as it gives a clear and deeper understanding of the logics . Also pray hard along with your preparation.
Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. Mention coding languages are known to you, or other technical skills that you are good at. Do not mention anything that you are not good at. Highlight the topics that you are really good at.
Tip 2 : Be very honest and figure out only those things in your resume that you really know. Anything extra or unknown may have a negative impact upon your interview if asked by the interviewer.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 135 minutes
Round difficulty - Medium
The round consisted of 5 sections. The Coding section had 2 questions, CS mutiple choice section had 8 MCQs, Problem solving multiple choice section had 7 MCQs, Advanced section had 1 programming question and the Subjective section had 2 questions. Each MCQ earned 5 marks for correct answer and -2 for incorrect answer.
- Q1.
Word Search Problem Statement
Given a two-dimensional grid of size
N x Mconsisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.The 'WORD' can b...
- Q2.
Climbing the Leaderboard Problem Statement
In a game leaderboard, scores determine rankings where the highest score gets rank 1. Players with identical scores share the same rank, followed by the next ran...
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
This was a technical round held over the zoom video call around 11:00 hours. I was given a code-pair link where I had to code. The interview started with the question - "Tell me about yourself." Then, he asked the subjects I studied and asked few things about data structures and algorithms. He asked my preferred language of coding and gave two coding problems to solve. Finally, he asked me to explain my project and then gave me a scenario where he extended the project and asked about my design and database approach for that case.
- Q1.
Partition to K Equal Sum Subsets Problem
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...
- Q2.
Partition Set Into Two Subsets With Minimum Difference
Given an array of N non-negative integers, split the array into two subsets such that the absolute difference between their sums is minimized.
The t...
(2 Questions)
Round duration - 20 minutes
Round difficulty - Easy
This was also a technical round held over the zoom video call around 14:00 hours. In this round also, I was given a code-pair link where I had to code. First of all, he asked me to introduce myself. Then, he asked about tree data structure and its practical implementation. Then, he gave me two coding questions to code. At last, he asked about the operating systems, i.e., Windows, Linux and have I ever installed Linux in my system by deleting Windows.
- Q1.
Prime Numbers Identification
Given a positive integer
N, your task is to identify all prime numbers less than or equal toN.Explanation:
A prime number is a natural number greater than 1 that has no po...
- Q2.
Find Pairs in a Doubly-Linked List
A sorted doubly-linked list of distinct positive integers is provided, along with an integer 'X'. Your task is to identify and print all unique pairs from the list whose...
Interview Preparation Tips
Tip 1 : Practice as much questions as you can from various coding platforms from the beginning but always remember that it's never late to start. It will help you to develop your logic building skills and gradually, you will be able to solve questions quickly. Solving code challenges is a great way to keep your skills sharp for interviews.
Tip 2 : Al least keep yourself aware to the basics of new emerging technologies.
Tip 3 : Prepare some good projects and keep complete details about them as well.
Tip 1 : Make it short and eye-catchy.
Tip 2 : Mention your academic and professional details properly with duration.
Tip 3 : Be honest about yourself. Don't put anything which is likely to cause you trouble during the interview.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
Timing: Evening around 5
The test was set up inside the computer centre and library of our institute.
There were people from GS and also from hackerrank who were conducting the test.
The test had mcqs + coding questions + essay writing.
Overall the paper I found was medium
- Q1.
Next Greater Number Problem Statement
Given a string
Swhich represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc... - Ans. Greedy Implementation
- First of all, we shall consider some base cases before moving on to the actual solution.
- If all the digits are sorted in ascending order, then just swap the last two digits, and return them, since it will give us the next greater number.
- If all the digits are sorted in descending order, then return -1, since we will not have any greater number than the given number which may contain the same set of d...
- First of all, we shall consider some base cases before moving on to the actual solution.
- Q2.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
- Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
- Take the starting position of th...
- Q3.
Fenwick Tree Problem Statement
You are provided with an array/list
ARRconsisting of 'N' integers, along with 'Q' queries. Each query can be of one of the following two types:- Type 1 (Range Sum): Give...
- Ans. Brute Force Approach
- The key idea of the approach is to process the queries as asked. i.e If range sum is asked we do a range sum using a loop and update the values in the array if it is an update query.
- Update will be a constant time operation but range sum can take time of order of ‘N’ .
We can take the following approach:
- For queries of type 1, we take a loop and iterate from ‘L’ to ‘R’ to find the sum and p...
(1 Question)
Round duration - 90 Miinutes
Round difficulty - Easy
The round included discussion over my resume and the projects I had made. Along with that, the person was fascinated by the co-curricular so he went on asking about those.
Finally we started discussing data structures and algorithm.
- Q1.
Maximum Subarray Sum Problem Statement
Given an array
arrof lengthNconsisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.Explanation...
- Ans. Brute Force Approach
Let us check for all possible subarrays of the array. For this, we run two loops, where the outer loop points to the left boundary and the inner loop points to the outer boundary of the subarray.
Using another loop inside, find the sum of this subarray. Compare it with the maximum subarray sum obtained so far. After checking all the subarrays, simply return the maximum sum found.
Space Complexit...
(2 Questions)
Round duration - 95 Minutes
Round difficulty - Hard
Round included Data Structures, System Design, Puzzle and HR based questions
- Q1.
Find K-th Smallest Element in BST
Given a binary search tree (BST) and an integer
K, the task is to find the K-th smallest element in the BST.Example:
Input:
BST: Order of elements in increasing order... - Ans. Recursion In-order
The basic idea is that traversal the whole tree in an inorder manner and adds the node values in an array and at the end return the ‘k-1’th element of the array. Due to BST property, inorder traversal of BST will in a sorted order( ascending ).
Code -
- Initialize a global array ‘arr’, which stores the elements of the BST.
- Use an ‘inorder(root)’ recursive function, to add all the child node in ‘arr’
- F...
- Q2. Can you design a system for a website similar to Instagram that caters to travelers?
Interview Preparation Tips
Tip 1 : Never give up on any question, Don't try to mug up the question, rather than understand the concept behind the topic, this will only help to solve the question while being in the interview.
Tip 2 : Never leave core topics like OS, DBMS etc. They are always asked in an interview
Tip 3 : Focus on core skills i.e DS and Algo but also focus on development projects, they are of much importance.
Tip 4 : Spend time on quality questions rather than the quantity of questions
Tip 1 : Properly formatted resume with no typos.
Tip 2 : No fancy and colourful resumes.
Tip 3 : Should have projects on your resume.
Tip 4 : Should have links to your GitHub and Linkedin and other competitive sites
Tip 5 : No false information to be mentioned, even in cocurricular
Skills evaluated in this interview
Goldman Sachs interview questions for designations
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round. The interviewer was very friendly. He started by asking tell me
something about yourself. I told him about my interest in competitive coding(since I am weak in
probability, I always mentioned competitive coding in my introduction so that the interviewer
asks me coding questions and didn’t move to the probability section).
- Q1.
Problem Statement: Minimize the Maximum
You are given an array of integers and an integer
K. For each array element, you can adjust it by increasing or decreasing it by a value ofK. Your goal is to minim... - Q2.
Minimum Number of Platforms Needed Problem Statement
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
- Q3.
Two and Four Wheeler Roads Problem Statement
There is a country with
Ncities andMbidirectional roads of 3 types:Type 1: Two Wheeler Road - Only vehicles with two wheels can use this road. Type 2: Fou...
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
The interviewer was very friendly to me. She was praising me for every solution that I provided.
- Q1.
Maximize Stock Trading Profit
You are given an array
prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i... - Q2.
Minimum Depth of a Binary Tree Problem Statement
Given a Binary Tree of integers, determine the minimum depth of the Binary Tree. The minimum depth is defined as the number of nodes present along the shor...
(1 Question)
Round duration - 50 minutes
Round difficulty - Easy
This round was about System Design, Data Structures and Algorithms
- Q1.
Arithmetic Progression Queries Problem Statement
Given an integer array
ARRof sizeN, perform the following operations:-
update(l, r, val):Add(val + i)toarr[l + i]for all0 ≤ i ≤ r - l.-
rangeSu...
Round duration - 30 minutes
Round difficulty - Easy
Only puzzles were asked in this round
Interview Preparation Tips
Tip 1 : It is important to practice coding consistently because it is what enables you to solve interview-questions in the stipulated time. But before this, it is even important to have a clear understanding of all the data-structures, so that they can be easily implemented as and when required to solve a problem. It is also mandatory to have a clear understanding of the time and space complexities of algorithms because this is what you are judged upon in real interviews. Good intuition and a good approach to solve a problem are what really helps to crack the interview of such companies.
Tip 2 : They do not judge you upon the number of internships you have done or the number of projects you have made. A single,good-quality project is sufficient, provided you have in-depth knowledge about it. What matters to them is how efficient a learner you are, how good is your problem-solving skill and also how confident you are with your answers.
Tip 3 : Practise topic-wise questions, participate in lots of coding contests, watch lots of Youtube solutions even after you could solve a question, because you may find a different approach that is efficient than yours, and watching video solutions is always a better option than just reading the solution, as it gives a clear and deeper understanding of the logics. Also, pray hard along with your preparation.
Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. Mention coding languages are known to you, or other technical skills that you are good at. Do not mention anything that you are not good at. Highlight the topics that you are really good at.
Tip 2 : Be very honest and figure out only those things in your resume that you really know. Anything extra or unknown may have a negative impact upon your interview if asked by the interviewer.
Skills evaluated in this interview
Get interview-ready with Top Goldman Sachs Interview Questions
Top trending discussions
Interview questions from similar companies
I applied via Company Website and was interviewed in Nov 2023. There was 1 interview round.
(1 Question)
- Q1. What is the toughest decision you’ve had to make in life?
Interview Preparation Tips
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 170 minutes
Round difficulty - Easy
For MCQ Round, we have 2 rounds:-
1. Logical Reasoning
2. Mathematical Reasoning
Logical Reasoning, in which there were 12 questions, and for each question we had a time limit of 75 seconds. There was a cut-off of 40 for the next round, and people who qualified were sent an e-mail with a link to continue with the process.
Numerical Reasoning-The questions were in a pair of 3 in which a table/bank statement was given and 3 questions were based on that. The questions were purely based on calculations and semi-subjective. The time given for the 1st question was 90 seconds and for the rest 2 questions, 75 seconds each
For Coding Round,
120 minutes window(Test was of 90 minutes)
We have two questions
For the first question(30 Minutes it can be solved 2 times)
For the second question(60 Minutes)
- Q1.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
- Q2.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
It was an face to face round.There were 2 interviewers and they asked me coding question and some puzzles and some questions related to my project which was mentioned in my resume.
- Q1.
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows:
F(n) = F(n-1) + F(n-2), with initial conditionsF(1) = F(2) = 1.Input:
... - Q2.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
Round duration - 30 minutes
Round difficulty - Medium
It was basically a resume round Interviewer went through my resume throughly and asked me about the things mentioned in my resume.
Round duration - 15 minutes
Round difficulty - Easy
It was a simple hr round and he asked me basic questions
Interview Preparation Tips
Tip 1 : Focus on Communication Skills
Tip 2 : Do atleast 2 projects
Tip 3 : Solve as many questions as possible.
Tip 1 : Put only those things which you are confident that you can answer anything .
Tip 2 : Have some projects on your resume.
Skills evaluated in this interview
Gaurav Shahani
(1 Question)
- Q1. Asked about SAAS, JS questions
Given a case study need to solve in 2 days
(1 Question)
- Q1. Explain the case study. Palindrome function in any prog language
- Ans.
A palindrome function checks if a given string reads the same forwards and backwards.
A palindrome function typically involves reversing the input string and comparing it to the original string.
Examples: 'racecar' is a palindrome, 'hello' is not a palindrome.
Common languages for implementing a palindrome function include Python, Java, and C++.
(1 Question)
- Q1. General Guidelines
Selected
I applied via Job Fair and was interviewed in Nov 2023. There were 2 interview rounds.
(3 Questions)
- Q1. I am freshers soo please one chance for your company
- Q2. Yes I am fresher soo for your company work
- Q3. Talk about a range of elements, including customer service.
- Ans.
Customer service is an essential element in software development.
Customer service involves providing support and assistance to users of software applications.
It includes addressing user queries, resolving issues, and ensuring customer satisfaction.
Software developers may interact with customers through various channels like email, phone, or live chat.
Good customer service can lead to positive user experiences and incre...
Interview Preparation Tips
(2 Questions)
- Q1. Challenges in development
- Ans.
Challenges in development include managing project timelines, debugging complex issues, and staying updated with new technologies.
Managing project timelines to ensure timely delivery of software
Debugging complex issues that arise during development
Staying updated with new technologies and tools to remain competitive in the industry
- Q2. Why Allianz, why leaving from current company
Skills evaluated in this interview
Goldman Sachs Interview FAQs
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 Software Developer Interview Questions
- Goldman Sachs Software Engineer Interview Questions
- Goldman Sachs Financial Analyst Interview Questions
- Goldman Sachs Senior Analyst Interview Questions
- Goldman Sachs Strategic Anaylst Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Goldman Sachs Software Analyst Interview Process
based on 1 interview
1 Interview rounds
- Coding Test Round
Top Skills for Goldman Sachs Software Analyst
Interview Questions from Similar Companies
Fast track your campus placements
Goldman Sachs Software Analyst Reviews and Ratings
based on 1 review
Rating in categories
|
Associate
2.5k
salaries
|  ₹10.6 L/yr - ₹40 L/yr |
|
Analyst
1.8k
salaries
| ₹9.6 L/yr - ₹14 L/yr |
|
Vice President
1.6k
salaries
| ₹18.5 L/yr - ₹72 L/yr |
|
Senior Analyst
1.1k
salaries
| ₹5 L/yr - ₹20 L/yr |
|
Financial Analyst
320
salaries
| ₹2 L/yr - ₹8 L/yr |
JPMorgan Chase & Co.
Morgan Stanley
TCS
Amazon
- Home >
- Interviews >
- Goldman Sachs Interview Questions >
- Goldman Sachs Software Analyst Interview Questions
