← Morgan Stanley questions

Minimum iterations to empty binary string

Filed under Morgan Stanley

Given a binary string, find the minimum number of iterations required to empty it by removing consecutive 1s or consecutive 0s in each step.

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 Morgan Stanley questions

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