Goldman Sachs Coderpad Interview experience
- Posted
- 28 Mar 2026
Summary
I solved two Coderpad questions for Goldman Sachs in about 50 minutes, but haven’t heard back about the superday.
How it went
1st Question : Given a 2D array marks which can contain positive and negative scores, find the max average.
String[][] = {{"Jethiya" : "20"}, {"Bida" : "50"}, {"Iyer Idli": "99"}, {"Jethiya" : "25"}} Ans : "Iyer Idli"
2nd question : Given a 2D array locations where each location can contain a value stone, you will start from (row-1, 0) and end at (0, col-1) find the optimal path where the maximum value can be achieved.
int[][] locations = {{9,0,2,0,1}, {0,1,1,1,0}, {2,0,0,0,0}} Ans : 14
Exactly same as 62. Unique Paths
I was able to solve both questions in 50 mins, but I didn't heard from the HR for superday. In how many days can I expect the Super day.
And what is usually asked in Super day. If any candidate who recently attended super day can share.
I applied via referral last year and gave OA in Jan but the process started now.
Questions asked (2)
- 01
Max Average in 2D Marks Array
Data Structures & Algorithms
Given a 2D array
markswhich can contain positive and negative scores, find the entry (name) with the maximum average score.Example input:
String[][] = {{"Jethiya" : "20"}, {"Bida" : "50"}, {"Iyer Idli": "99"}, {"Jethiya" : "25"}}The expected answer is "Iyer Idli".
- 02
Optimal Path for Maximum Value in 2D Grid
Data Structures & Algorithms
Given a 2D integer array
locationswhere each cell can contain a value (stone), start from the bottom‑left cell(row‑1, 0)and end at the top‑right cell(0, col‑1). Find a path that maximizes the sum of values collected.Example input:
int[][] locations = {{9,0,2,0,1}, {0,1,1,1,0}, {2,0,0,0,0}}The expected answer (maximum sum) is
14.Note: This problem is described as being exactly the same as LeetCode 62 – Unique Paths.