Open In App

Similar Reads

Goldman Sachs Interview Experience | Set 39 (1.5 years experience)
I got contacted by a recruiter agency. 1st Round (HackerRank Test 1 Hour 30 Mins): 1) https://www.geeksforgeeks.org/print-number-ascending-order-contains-1-2-3-digits/ 2) 2. Given a sequence of M and N with M representing increasing and N representing decreasing, output the smallest number that follows this pattern. Input : MMMM Output : 12345 Inpu
1 min read
Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role)
I went through an interview at Goldman Sachs in their Bengaluru office for Java Developer role, and I would like to share my experience with you to help everyone to go through and prepare well for the same. Reporting time was 9.30 am, I reached there before time, was given a temporary id, and rounds started at around 11 am. Round 1 (written : 1 hr)
6 min read
Goldman Sachs Interview Experience | Set 35 (For Experienced)
Goldman Sachs conducted a Code Sprint where 6 challenges were given. I solved 4 of them and was ranked below 1600 out of 10120 candidates. After this I got a call from the HR to appear for the next rounds. 1st Round: HackerRank Test (1 hr 30 min) 1. Given n and an array of strings, print the string that contains the digits (1, 2, 3), if there are m
3 min read
Goldman Sachs Interview Experience | Set 36 (For Experienced)
I have interviewed with Goldmanc sachs in Nov-17. The process  is very slow as in my case first round was started in Sept-17 and last round ended in Nov-17. Round 1: First was the HackerRank Test. Two Coding questions, first easy ,second Medium to Hard Level. Note: I do not remember the exact wording of the question. 1.)  Given an string and a burs
4 min read
Goldman Sachs Interview Experience | Set 36 (On-Campus)
Goldman Sachs visits our campus every year for both campus placements and internships. Of late, their process has become pretty stable, they generally conduct a three part test online, followed by interviews on day 1 (December 1). I applied via the campus placement cell, was shortlisted for interview, and eventually was given an offer (which I acce
17 min read
Goldman Sachs Interview Experience | Set 37 (For Experienced)
I appeared for the Goldman Sachs recruitment process for the position of Technical Analyst, Bangalore. I applied via employee referral. Round 1: Hackerrank written test Two questions were there in the round. 1.) Spiral order traversal of the matrix 2.) Subarray with 0 sum Round 2: Coderpad round This is a telephonic interview and a screen is shared
6 min read
Goldman Sachs Interview Experience | Set 38
Online Test The online contest was held on hackerrank platform. The test was same for all the IITs and was conducted at the exact date and time in all the campuses. There were three sections - CS (5 MCQ and 2 coding questions), Quant (10 MCQs) and ML (10 MCQs) . Each MCQ carried +3 for correct answer and -1 for incorrect answer. The test duration w
5 min read
Goldman Sachs Interview Experience | Set 41
Round 1: Hackerrank Round 1: Find the total number of common digits in some range of numbers. 2: Knapsack problem variation, and expected output was the array of items and not the maximum value. Round 2:  Coderpad Round 1: The rain water tapping problem. https://www.geeksforgeeks.org/trapping-rain-water/ 2: given array of students and their marks i
2 min read
Goldman Sachs Interview Experience | Set 42 (Less than 1 year experienced)
Round 1(HackerRank) 1: Related to find the total number of common digits in some range of numbers. 2: Knapsack problem variation, and expected output was the array of items and not the maximum value. Round 2(CoderPad) 1.Non repeating character in a string. https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/ Discussi
2 min read
Goldman Sachs Interview Experience | Set 43
(Lateral Hire; Experience: 4 Years; For Bangalore location) Round 1: HackerRank round; 2 problems; Time: 2 Hours (Java language): 1. Given a string containing parentheses and other characters and a number n, output the position (index) of the closing parenthesis corresponding to the nth opening parenthesis. In case the parentheses are unbalanced, o
4 min read