← Goldman Sachs questions
CodingReported in a candidate post, Jul 2025

Rapid-fire tree height, postorder problem, merge sort versus quick sort

Filed under Goldman Sachs

A rapid-fire round of short questions, about 4-5 minutes each: find the height of a binary tree; name a problem solved well with postorder traversal; compare merge sort and quick sort on arrays and on…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.