# Reordering Train Cars solutions

Reordering Train Cars was solved using Haskell by 10 contestants. Solution sizes: average 3292 bytes (shortest: 511; longest: 7669).

The list below is sorted by ranking. You can also sort by solution size.

Reordering Train Cars was solved using Haskell by 10 contestants. Solution sizes: average 3292 bytes (shortest: 511; longest: 7669).

The list below is sorted by ranking. You can also sort by solution size.