Minimum adjacent swaps to group a binary array
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.
AmazonOnline assessmentNo answer yet. Write the first one; the best answer gets endorsed.