Problem4

problem4.hs

-- Write a function that given a list of non negative integers,
-- arranges them such that they form the largest possible number.
-- For example, given [50, 2, 1, 9], the largest formed number is 95021.
-- Source: https://blog.svpino.com/2015/05/07/five-programming-problems-every-software-engineer-should-be-able-to-solve-in-less-than-1-hour
import Data.List

intCombinations :: [Int] -> [Int]
intCombinations xs = map (read.concat.(map show)) (permutations xs)

-- usage: solve [50, 2, 1, 9]
solve :: [Int] -> Int
solve = (foldl max 0) . intCombinations