Gamified challenge · Backtracking
floats holds the parade floats, each a different number. A marching order lists every float exactly once, front to back.
Write permutations(floats) that returns every marching order exactly once. Order inside each marching order matters ([1, 2] and [2, 1] are different parades), but the list of orders may come in any order. An empty street has exactly one (empty) order: [[]].
Example: floats = [1, 2, 3] gives the 6 orders [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 2, 1], [3, 1, 2]].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google