← Questions
Minimum adjacent swaps to group a binary array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an array of 0s and 1s, return the fewest swaps of neighbouring elements that put all the 0s at one end and all the 1s at the other. Either order is allowed.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding