Goldman Sachs SuperDay Interview (Associate)
Summary
I successfully navigated a HackerRank test and a coderpad screening round for an Associate role at Goldman Sachs. Despite performing well on several DSA questions, I was ultimately rejected after the SuperDay.
Full Experience
Gave hackerrank test around 3 month ago. After a week, got a call for coderpad screening round, after multiple rescheduling it got scheduled on 18th june. 1st question for coderpad round was First Non Repeating character in String 42. Trapping Rain Water (the must do problem for GS) solved both of them correctly along with edge cases. On the same day got call from HR that coderpad round feedback was positive so they scheduled superday for 25th june.
Round1 2 DSA questions 1. Design a DS where insertion , deletion and getValue(Index) all should be in O(1) 2.Binary search on Answers Ship in D days
Answered 2 with optimal solutions
Round 2 2 DSA questions 1.Given a string representing a mathematical expression (like "3 + 2 * (1 + 1)"), evaluate the result by following the correct BODMAS precedence rules (Brackets, Orders, Division, Multiplication, Addition, Subtraction). 2. Make a Number Minimum by removing K digits
Unable to solve 2nd question
verdict :Rejected
Interview Questions (6)
First Non-Repeating Character in a String
Find the first non-repeating character in a given string.
Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Design Data Structure with O(1) Insert, Delete, and GetValue(Index)
Design a data structure where insertion, deletion, and getValue(Index) operations all should be in O(1) time complexity.
Capacity To Ship Packages Within D Days
Given a set of packages and a number of days D, find the least weight capacity of the ship that will result in all the packages being shipped within D days. This typically involves binary search on the answer space.
Evaluate Mathematical Expression with BODMAS
Given a string representing a mathematical expression (like "3 + 2 * (1 + 1)"), evaluate the result by following the correct BODMAS precedence rules (Brackets, Orders, Division, Multiplication, Addition, Subtraction).
Remove K Digits to Make Number Minimum
Given a non-negative integer represented as a string, remove k digits from the number so that the new number is the smallest possible.