Problem 59: Implement 'sumAscii :: String -> Integer' to sum the ASCII values of the characters in a string
Project Euler: Simplify 'count :: (Ord a) => [a] -> [(a, Int)]'

Simplify implementation of 'count :: (Ord a) => [a] -> [(a, Int)]'
by using the map, group, and sort functions from the Haskell library.
Problem 59: Replace 'makesMinimum :: (Ord b) => (a -> b) -> [a] -> a' with makesMaximum :: (Ord b) => (a -> b) -> [a] -> a
Problem 59: Remove 'dist :: (Num a) => [a] -> [a] -> a' and 'insertAll :: (Ord a) => [a] -> [a] -> [a]'
Problem 59: Implement 'letterCount :: [Int] -> Int'
Problem 59: Finish implementing solution
Problem 59: Alternative implementation of 'makesMaximum :: (Ord b) => (a -> b) -> [a] -> a'
Problem 59: Clean up 'main'
Problem 384: Move old/problem384.hs to problem384.hs
Problem 384: Implement 'toBinaryString :: Integer -> String'
Problem 384: Implement 'a :: Integer -> Integer' using 'toBinaryString :: Integer -> String'
Problem 384: Implement 'b :: Integer -> Integer'
Problem 384: Implement 's :: Integer -> Integer' and 'ss :: [Integer]'
Problem 384: Implement 'fib :: Integer -> Integer'
Problem 384: Implement 'g :: Integer -> Integer -> Integer'
Problem 384: Implement 'gf :: Integer -> Integer'
Problem 384: Implement 'as :: [Integer]' and 'bs :: [Integer]'
Problem 384: Alternative implementation for 'fib :: Integer -> Integer'