Hi, I'm not sure I understand the second example. Shouldn't the second one also produce an answer of 1 (swap the one in index 1 with the zero in the last index) 0 *1* 0 1 1 1 *0*
icy` On Tuesday, March 29, 2016 at 10:00:21 AM UTC-4, Régis Bacra wrote: > > 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].
