Goldman Sachs | CoderPad Round | Interview Experience

1. Introduction

• Brief candidate and interviewer introductions.

2. Technical Questions

Q1: Maximum Stone Collection

• Problem: 2D matrix where each cell has stones. Start at bottom-left, reach top-right.
• Movements: Only Up and Right allowed.

Q2: Largest Tree in a Forest

• Problem: Given a list of (child, parent) pairs. Find the root of the tree with the maximum number of nodes.
• Tie-breaker: If two trees have the same maximum size, return the root with the higher ID.