Separate Black and White Balls at Amazon

Problem Description

There are `n` balls on a table, each ball has a color black or white. You are given a **0-indexed** binary string `s` of length `n`, where `1` and `0` represent black and white balls, respectively. In each step, you can choose two adjacent balls and swap them. Return _the**minimum** number of ste...

Topics

Also asked at 5 companies