[Haskell][24] Adding Solution

haskell/src/0024.hs

@@ -0,0 +1,16 @@
+{-
+A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:
+012   021   102   120   201   210
+What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
+-}
+
+import Utils
+
+import Data.List
+import Data.Char
+
+solution :: Int
+solution = read ((permutations [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] |> map (map intToDigit) |> sort) !! 999999)
+
+main :: IO ()
+main = putStrLn ("Solution: " ++ show solution)