Maximize Segregation Cost

Problem Overview

• Given a binary string, determine the maximum number of operations possible to fully segregate all 1s to the end.
• Each operation selects a '1' and moves it right to the furthest possible position (end or next '1'); its cost equals 1 plus the distance moved.
• Input: string s of 0s and 1s; Output: integer for the maximum operations; constraints not specified.
• Real-world context: segregation within an integrated binary circuit.
• Asked in Akuna interviews; a coding interview problem and common interview question.