Quick Overview

Given a binary string, repeatedly move a `1` to the right across adjacent `0` characters until all zeros precede all ones. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

Minimum Movement Cost to Segregate Binary Digits

Company: Akuna Capital

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Overview: Given a binary string, repeatedly move a `1` to the right across adjacent `0` characters until all zeros precede all ones. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

Loading…