This puzzle comes from a contribution on codingame.com (link to the puzzle <https://www.codingame.com/games/community/?puzzleId=103>). Any idea to solve it efficiently?
Given a list of 1 and 0, you must regroup all the 1 at the begin of the list in a minimum number of steps. A step is the interchange of two elements located at different positions. The expected result is the minimum number of steps required to obtain a sorted list. Examples: 1 0 1 0 1 -> 1 0 1 0 1 1 1 0 -> 2 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
