Goldman Sachs | Coderpad
- Posted
- 6 May 2026
Summary
Interview experience for Goldman Sachs Coderpad round with two coding questions focused on algorithms.
How it went
I was contacted for the Coderpad round at Goldman Sachs for the VP position. The interview consisted of two coding problems that tested fundamental algorithmic skills. The first problem involved searching in a rotated sorted array, while the second dealt with processing a forest structure represented by child-parent relationships.
Questions asked (2)
- 01
Find Minimum in Rotated Sorted Array
Data Structures & Algorithms · Medium
Given a sorted rotated array with unique elements, find the minimum element in O(log n) time complexity.
- 02
Largest Tree Root in Forest
Data Structures & Algorithms · Medium
Given a forest represented as a collection of child-parent relationships, determine the root node of the largest tree. In case of a tie, return the root with the smallest value.