← Goldman Sachs questions

Distinct numbers by flipping bits

Filed under Goldman Sachs

Given K numbers represented in n bits, count the number of distinct numbers that can be formed by flipping any subset of 0-bits to 1-bits.

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.