Day 5

Day2/puzzle1.hs

@@ -2,9 +2,9 @@ import Data.List (sort)
 
 isSafe :: [Int] -> Bool
 isSafe xs = (isAscending xs || isDescending xs) && maximum distances <= 3 && minimum distances >= 1
-            where isAscending xs = xs == sort xs
+            where isAscending xs  = xs == sort xs
                   isDescending xs = xs == reverse (sort xs)
-                  distances = map abs $ zipWith (-) xs (tail xs)
+                  distances       = map abs $ zipWith (-) xs (tail xs)
 
 main = do
     contents <- lines <$> readFile "day2.txt"