Filter interviews by
Merge sort is a divide-and-conquer algorithm that sorts an array by recursively splitting and merging sorted subarrays.
Divide the array into two halves until each subarray has one element.
Merge the sorted subarrays back together in sorted order.
Time complexity is O(n log n), making it efficient for large datasets.
Example: Sorting [38, 27, 43, 3, 9, 82, 10] results in [3, 9, 10, 27, 38, 43, 82].
Binary Search is an efficient algorithm for finding an item from a sorted list of items.
Binary Search works on sorted arrays. Example: [1, 2, 3, 4, 5]
It repeatedly divides the search interval in half.
If the target value is less than the middle element, search the left half.
If the target value is greater, search the right half.
Time complexity is O(log n), making it faster than linear search.
Recursion is a programming technique where a function calls itself in order to solve a problem.
Recursion involves breaking down a problem into smaller subproblems and solving them recursively.
A base case is needed to stop the recursion and prevent infinite loops.
Examples of recursive functions include factorial calculation and Fibonacci sequence generation.
Topological sorting is an ordering of vertices in a directed acyclic graph (DAG) where each directed edge u -> v implies u comes before v.
Topological sorting is applicable only for Directed Acyclic Graphs (DAGs).
It can be implemented using Depth First Search (DFS) or Kahn's algorithm.
Example: For a graph with edges (5, 2), (5, 0), (4, 0), (4, 1), (2, 3), (3, 1), a valid topological sort could be [5, 4, 2, 3, 1,...
Merge overlapping intervals in a list to create a consolidated list of intervals.
Sort the intervals based on the start time.
Initialize an empty list to hold merged intervals.
Iterate through the sorted intervals and compare the current interval with the last merged interval.
If they overlap, merge them by updating the end time of the last merged interval.
If they don't overlap, add the current interval to the merged ...
Determine if two strings are anagrams of each other by comparing character counts.
An anagram is a rearrangement of letters in a word or phrase. Example: 'listen' and 'silent'.
Count the frequency of each character in both strings using a hash map.
Compare the two frequency maps; if they are identical, the strings are anagrams.
Consider edge cases: empty strings and strings of different lengths cannot be anagrams.
Swap two numbers using only 2 variables
Use XOR operation to swap two numbers without using a third variable
Example: a = 5, b = 10; a = a ^ b; b = a ^ b; a = a ^ b; // a = 10, b = 5
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divide the array into two sub-arrays based on a pivot element
Recursively sort the sub-arrays
Combine the sorted sub-arrays
Linux scheduler manages background processes using priority levels and time slices for efficient CPU utilization.
Linux uses a Completely Fair Scheduler (CFS) for process scheduling.
Background processes typically have lower priority than foreground processes.
CFS allocates CPU time based on process weight, ensuring fairness.
Processes can be run in the background using '&' in the command line.
Example: 'sleep 10 &...
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
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
It was an Online assessment composed of two parts: A Mathematical part and a Coding question.
I manage stress by staying organized, prioritizing tasks, and maintaining a positive mindset to navigate challenges effectively.
I create a prioritized to-do list to focus on urgent tasks first, which helps me stay organized.
During a group project with tight deadlines, I facilitated regular check-ins to ensure everyone was on track and supported.
I practice mindfulness techniques, such as deep breathing, to calm my mind ...
Recursion is a programming technique where a function calls itself in order to solve a problem.
Recursion involves breaking down a problem into smaller subproblems and solving them recursively.
A base case is needed to stop the recursion and prevent infinite loops.
Examples of recursive functions include factorial calculation and Fibonacci sequence generation.
Design a system using EC2 instance Fleet on Leetcode platform
Utilize EC2 instance Fleet to manage a group of EC2 instances for scalability and cost-efficiency
Implement load balancing to distribute incoming traffic across multiple EC2 instances
Use auto-scaling to automatically adjust the number of EC2 instances based on traffic demand
Monitor system performance and health using CloudWatch metrics and alarms
I applied via Approached by Company and was interviewed in May 2024. There were 4 interview rounds.
I chose Goldman Sachs for its global reach and diverse opportunities. I left Morgan Stanley to pursue new challenges and growth.
Goldman Sachs offers a wider range of global opportunities compared to Morgan Stanley
I was seeking new challenges and growth that I believed Goldman Sachs could provide
I was attracted to the diverse and innovative culture at Goldman Sachs
I will provide training and guidance to help the team learn and adapt to handling credit card transactions.
Provide thorough training on credit card processing procedures
Offer guidance and support as team members gain experience
Implement regular check-ins and feedback sessions to address any challenges
Encourage open communication and a collaborative team environment
Utilize resources such as online tutorials or industry ...
I applied via Goldman Sachs and was interviewed in Jul 2024. There were 3 interview rounds.
They asked on SparkSQl, Pandas SQL and also on SQL
They asked on Python and DS
It was a quite good exp and i clerd that round and i got an offer in those in that company company company company company
I have experience with high salary expectations.
I have experience negotiating high salaries based on my skills and experience.
I have successfully secured high salary offers in previous roles.
I am confident in my ability to justify and negotiate for a high salary based on market rates and my qualifications.
I appeared for an interview in Mar 2025, where I was asked the following questions.
I applied via Company Website and was interviewed in Apr 2024. There were 3 interview rounds.
Hardest part of the process, Wide range of questions and time consuming and you don't have much time in this, try to solve as much as you can
Basic aptitude having questions from different topics
I applied via Walk-in and was interviewed in Sep 2024. There was 1 interview round.
Goldman Sachs offers unparalleled opportunities for growth, learning, and development in the finance industry.
Global reputation as a top investment bank
Access to high-profile clients and deals
Extensive training and mentorship programs
Opportunities for career advancement and mobility
Competitive compensation and benefits
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Experience with programming languages like Java, Python, and C++
Completed internships at tech companies such as Google and Microsoft
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 3 interview rounds.
I applied via Internshala and was interviewed in Sep 2024. There were 2 interview rounds.
It was easy and main question wweer from mathr
Question from dsa cp segment tress
Top trending discussions
Some of the top questions asked at the Goldman Sachs interview for freshers -
The duration of Goldman Sachs interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 35 interview experiences
Difficulty level
Duration
based on 1.4k reviews
Rating in categories
Bangalore / Bengaluru
4-9 Yrs
Not Disclosed
Bangalore / Bengaluru
4-9 Yrs
Not Disclosed
Associate
2.5k
salaries
| ₹19 L/yr - ₹35 L/yr |
Analyst
1.9k
salaries
| ₹11.3 L/yr - ₹21.1 L/yr |
Vice President
1.8k
salaries
| ₹35.8 L/yr - ₹60 L/yr |
Senior Analyst
1.3k
salaries
| ₹9.1 L/yr - ₹15.1 L/yr |
Senior Associate
411
salaries
| ₹14.9 L/yr - ₹26.8 L/yr |
JPMorgan Chase & Co.
Morgan Stanley
TCS
Amazon