crclark96

import Data.List (sortOn)

reorder :: [Char] -> [Int] -> [Char]
reorder a b = map fst . sortOn snd $ zip a b

a = ['C'..'H']
b = [3, 0, 4, 1, 2, 5]

main = putStrLn $ reorder a b

crclark96

#!/bin/bash
tail -n+3 "$0" | gcc -xc - && ./a.out && rm ./a.out ; exit
//

#include <stdio.h>
int main() {
  printf("C is a scripting language!\n");
}

crclark96

Prelude Data.List> numChars s c = foldr (\x acc -> if x == c then acc+1 else acc) 0 s
Prelude Data.List> numChars "oh heavens" 'h'
2

crclark96

*Main> moveZeros [1, 2, 0, 1, 0, 0, 3, 6]
[1,2,1,3,6,0,0,0]

crclark96

import Data.List
import Data.Ord

charNumSort :: [String] -> [String]
charNumSort = sortBy ((comparing $ length . nub) `mappend` (comparing $ Down . length))

crclark96

/tmp
➜ ./a.out
0
1
2
1
8
1
32

crclark96

/tmp
➜ ./a.out
0
1
0
1
0
1

crclark96

*Main> oneRow ["candy","doodle","pop","shield","lag","typewriter"]
["pop","lag","typewriter"]

crclark96

*Main> maxPointsOnLine [(1,1), (3,2), (5,3), (4,1), (2,3), (1,4)]
4

crclark96

import Control.Monad

generateParens :: Int -> [String]
generateParens n = generateParens' n ""

generateParens' :: Int -> String -> [String]
generateParens' n xs
  | n == o = [xs ++ replicate u ')']
  | u == 0 = generateParens' n (xs ++ "(")
  | otherwise = [xs ++ "(", xs ++ ")"] >>= generateParens' n