← Goldman Sachs questions

Building bridges dynamic programming problem

Filed under Goldman Sachs

Given a set of bridges with north and south bank coordinates (ni, si), find the maximum number of non-intersecting bridges that can be built. Bridges cannot cross each other.

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.