the 99 problems

last [1, 2, 3, 4]

last . init $ [1,2,3,4]

[1,2,3,4,5] !! 2

length [1,2,3,4,5]

reverse [1,2,3,4,5]

let isPalindrome a = reverse a == a
isPalindrome [1,2,3,2,1]

:set +m
data NestedList a = Elem a | List [NestedList a]

let flatten (List []) = []
    flatten (Elem a) = [a]
    flatten (List (x:xs)) = flatten x ++ flatten (List xs)

flatten (List [Elem 1, List [Elem 2, List [Elem 3, Elem 4], Elem 5]])

import Data.List
map head $ group "aaaabccaadeeee"

group ['a', 'a', 'a', 'a', 'b', 'c', 'c', 'a', 'a', 'd', 'e', 'e', 'e', 'e']

map (\n -> (head n, length n)) $ group "aaaabccaadeeee"

:set +m
import Data.List
data Modified a b = Single b | Multiple a b deriving Show
let encode = map (\n -> (head n, length n)) . group 
let encodeModified = map modify . encode where
      modify (b, 1) = Single b
      modify (c, d) = Multiple d c

encodeModified "aaaabccaadeeee"

let decodeModified [] = []
    decodeModified (x:xs) = decode x ++ decodeModified xs where
      decode (Multiple a b) = replicate a b  
      decode (Single a) = [a]

decodeModified [Multiple 4 'a',Single 'b',Multiple 2 'c', Multiple 2 'a',Single 'd',Multiple 4 'e']

encodeModified "aaaabccaadeeee"

let dupli = concatMap (replicate 2)

dupli [1,2,3,4]

let dupli a b = concatMap (replicate b) a

dupli [1,2,3,4] 3

let dropEvery a n = map fst $ filter (\(d, i) -> i `mod` n /= 0) $ zip a [1..]

dropEvery "abcdefghik" 3

splitAt 3 "abcdefghik"

let slice c a b = take (b-a+1) $ drop (a-1) c

slice ['a','b','c','d','e','f','g','h','i','k'] 3 7

let rotate a n = drop (c n) a ++ take (c n) a where
      c d = ((length a) + d) `mod` (length a)

rotate ['a','b','c','d','e','f','g','h'] 3
rotate ['a','b','c','d','e','f','g','h'] (-2)

let removeAt n a = (a !! (n-1), take (n-1) a ++ drop (n) a)

removeAt 3 "abcd"

let insertAt x a n = fst b ++ [x] ++ snd b where
      b = splitAt (n-1) a

insertAt 'X' "abcd" 2

range a b= [a..b]
range 4 9

import System.Random
let rnd_select xs n = do
    gen <- getStdGen
    return $ take n [ xs !! x | x <- randomRs (0, (length xs) - 1) gen]

rnd_select "abcdefgh" 3

let diffSelect xs n = do
    gen <- getStdGen
    return $ (take n . nub) [ xs !! x | x <- randomRs (0, (length xs) - 1) gen]


diffSelect 6 43

import Data.List
let permu xs = do
    gen <- getStdGen
    return $ take 10 [ xs !! x | x <- randomRs (0, (length xs) - 1) gen]

permu "asdfasdf"

import Data.List
permutations "asd"

let combinations _ [] = []
    combinations 0 _ = [[]]
    combinations n (x:xs) = map (x:) (combinations (n-1) xs) ++ combinations n xs

combinations 3 "abcdef"

filter (\x -> ((length x)==3)) $ subsequences "abcdef"

combinations n = filter (\x -> ((length x)==n)) $ subsequences
group ns xs = map ($ xs) $ map combinations ns

group [2,3,4] ["aldo","beat","carla","david","evi","flip","gary","hugo","ida"]

sortOn length ["abc","de","fgh","de","ijkl","mn","o"]

isPrime p = filterPrime [2..p] where
  filterPrime [] = False
  filterPrime (x:xs) | x == p = True
                     | otherwise = filterPrime [y | y <- xs, y `mod` x /= 0]

isPrime 7

gcd 36 63

let mygcd 0 a = a
    mygcd a 0 = a
    mygcd a b = mygcd b (a `mod` b)

mygcd 36 63

:set +m
let coprime :: Int -> Int -> Bool
    coprime a b = (==1) $ gcd a b

coprime 35 36

totient n = length $ filter (coprime n) [1..n]
totient 10

let primes = filterPrime [2..] where
      filterPrime (p:xs) = p:[x | x <- xs, x `mod` p /=0]

let primeFactors :: Int -> [Int] -> [Int]
    primeFactors n (p:xs) | (n < p) = []
                          | (n `mod` p) == 0 = p:(primeFactors (n `div` p) (p:xs))
                          | otherwise = primeFactors n xs

primeFactors 315 primes

import Data.List
primeFactorMult n = map (\x -> (head x, length x)) $ group $ primeFactors n primes

primeFactorMult 315