Goldman sachs coderpad round for Associate
August 13, 2026 · 1 reads
Summary
I completed a CoderPad round for an Associate position at Goldman Sachs, which featured problems similar to Trapping Rain Water and Find Minimum in Rotated Sorted Array.
Full Experience
1.) https://leetcode.com/problems/trapping-rain-water/description/ similar qus line this, the scenario is changed 2.) https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ same qus like this
Interview Questions (2)
1.
Trapping Rain Water
Data Structures & Algorithms·Hard
Given n non‑negative integers representing an elevation map where the width of each bar is 1, compute how much water can be trapped after it rains.
Example:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
2.
Find Minimum in Rotated Sorted Array
Data Structures & Algorithms·Medium
Given a rotated sorted array of distinct integers, find the minimum element.
Example:
Input: nums = [4,5,6,7,0,1,2]
Output: 0