Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There were 5 interview rounds.
F2f virtual coding round
Aptitude , gk, basic eco
Data structure from stack to bst to graph dp,
Data structure based , stack to bst to graph dp
I was interviewed before Jan 2023.
Trapping rainwater problem
The problem involves calculating the amount of rainwater that can be trapped between bars in an elevation map
Use two pointers approach to calculate the water trapped at each bar
Keep track of the maximum height on the left and right of each bar to calculate the trapped water
Search for a target value in a sorted n*n matrix.
Start from the top-right corner or bottom-left corner of the matrix.
Compare the target value with the current element and move left or down accordingly.
Repeat until the target value is found or the boundaries of the matrix are crossed.
Create a Binary Search Tree (BST) from an incoming stream of nodes.
Start with an empty BST
For each incoming node, compare it with the root node and insert it accordingly
Repeat the process until all nodes are inserted
Goldman Sachs interview questions for designations
I was interviewed before Sep 2020.
Round duration - 40 minutes
Round difficulty - Easy
Timing: 12PM
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
The interviewer was very polite and helpful. She dropped hints in between to help me reach the final solution when I was stuck or needed some clarity. She wanted to check how analytically I could solve the problem. She focused more on my approaches towards the problem.
There was also a brief discussion on my resume and projects.
Given an N-ary tree where each node has at most 'N' child nodes, the task is to serialize the tree into a sequence of bits and then deserialize it back t...
Round duration - 40 minutes
Round difficulty - Medium
Timing: Mid-afternoon
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
The interviewer was very polite and helpful. He dropped hints in between to help me reach the final solution when I was stuck or needed some clarity. He wanted to check how analytically I could solve the problem. He focused more on my approaches towards the problem.
There was also a brief discussion on my resume and projects.
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...
Round duration - 30 Minutes
Round difficulty - Medium
Timing: Evening
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
There was a panel of three people as interviewers in this round.
I was also asked one behaviour questions in this round.
You are provided with a directory path in Unix-style notation, and your task is to simplify it according to given rules.
In a Unix-style file system:
Tip 1 : Focus on Data Structures and Algorithms. Practising questions based on them every day is the key to succeeding. You can enroll into a Data Structures and Algorithms course by Coding Ninjas. This course helped me build a strong foundation in these topics. I also recommend platforms like LeetCode and InterviewBit for further practice.
Tip 2 : During your interview THINK OUT LOUD!!! It is very important that you voice your approach towards the problem otherwise interviewer will have no clue what you are thinking.
Tip 3 : Do give mock interviews to some college senior or mentor. They help you understand how to express your thought process better (Think out loud) and also reduce the interview stress and anxiety.
Tip 1 : In order to make a strong resume you must include at least 2-3 Projects and an intern/work experience. Mention all your skills which you are confident of in your resume.
Tip 2 : Try to make it of one page only. You can use overleaf to make your resume.
Get interview-ready with Top Goldman Sachs Interview Questions
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be n...
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
Top trending discussions
Some of the top questions asked at the Goldman Sachs Software Engineer interview -
based on 5 interviews
1 Interview rounds
based on 15 reviews
Rating in categories
Associate
2.5k
salaries
| ₹10.5 L/yr - ₹40 L/yr |
Analyst
1.8k
salaries
| ₹9.5 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
315
salaries
| ₹2 L/yr - ₹8.5 L/yr |
JPMorgan Chase & Co.
Morgan Stanley
TCS
Amazon