Cabal Updates with Related Clean-up

.gitignore

@@ -0,0 +1,25 @@
+# Created by https://www.gitignore.io/api/haskell
+
+### Haskell ###
+dist
+dist-*
+cabal-dev
+*.o
+*.hi
+*.chi
+*.chs.h
+*.dyn_o
+*.dyn_hi
+.hpc
+.hsenv
+.cabal-sandbox/
+cabal.sandbox.config
+*.prof
+*.aux
+*.hp
+*.eventlog
+.stack-work/
+cabal.project.local
+.HTF/
+
+# End of https://www.gitignore.io/api/haskell

ChangeLog.md

@@ -0,0 +1,5 @@
+# Revision history for CtCI-6th-Edition-Haskell
+
+## 0.1.0.0  -- YYYY-mm-dd
+
+* First version. Released on an unsuspecting world.

CtCI-6th-Edition-Haskell.cabal

@@ -0,0 +1,121 @@
+name:                CtCI-6th-Edition-Haskell
+version:             0.1.0.0
+synopsis:            Haskell Solutions for Cracking the Coding Interview 6th Edition
+
+-- description:         
+
+homepage:            https://github.com/careercup/CtCI-6th-Edition-Haskell
+bug-reports:         https://github.com/careercup/CtCI-6th-Edition-Haskell/issues
+-- license:             
+license-file:        LICENSE
+author:              Variuos Contributors
+maintainer:          NA
+-- copyright:           
+-- category:            
+build-type:          Simple
+cabal-version:       >= 1.10
+tested-with:         GHC == 8.0.*
+
+extra-source-files:
+    ChangeLog.md
+  , LICENSE
+  , README.md
+  , Setup.hs
+
+source-repository head
+  type:     git
+  location: https://github.com/careercup/CtCI-6th-Edition-Haskell
+
+library
+  default-language:    Haskell2010
+
+  ghc-options:         -Wall -fwarn-tabs -fwarn-monomorphism-restriction
+                       -fwarn-unused-do-bind
+
+  hs-source-dirs:
+      src
+
+  exposed-modules:
+      Introduction.VI.Example01
+
+  other-modules:       
+
+  build-depends:
+      base == 4.9.*
+
+  other-extensions:
+
+test-suite CtCI-6th-Edition-Haskell-Tests
+  default-language:    Haskell2010
+  type:                exitcode-stdio-1.0
+  main-is:             Spec.hs
+
+  ghc-options:         -Wall -fwarn-tabs -fwarn-monomorphism-restriction
+                       -fwarn-unused-do-bind
+
+  hs-source-dirs:
+      src
+    , test
+
+  other-modules:
+      Introduction.VI.Example01
+    , Introduction.VI.Example01Spec
+
+  build-tool-depends:
+      hspec-discover:hspec-discover == 2.4.*
+
+  build-depends:
+      base       == 4.9.*
+    , hspec      == 2.4.*
+    , QuickCheck == 2.9.*
+
+  other-extensions:
+
+test-suite tests
+  default-language:    Haskell2010
+  type:                exitcode-stdio-1.0
+  main-is:             Main.hs
+
+  ghc-options:         -Wall -fwarn-tabs -fwarn-monomorphism-restriction
+                       -fwarn-unused-do-bind
+
+  hs-source-dirs:
+      src
+    , src/chapter-1
+    , src/chapter-2
+    , src/chapter-3
+
+  other-modules:
+--      Ch1
+--    , Ch2
+--    , Ch3
+--    , Data.Queue
+--    , Data.Stack
+--    , find-cycle
+--    , intersection
+--    , is-palindrome
+--    , is-permutation
+--    , is-rotation
+--    , is-unique
+--    , kth-last
+--    , one-away
+--    , palindrome-permutation
+--    , partition
+--    , Questions.MinStack
+--    , remove-dups
+--    , remove-node
+--    , rotate-matrix
+--    , string-compression
+--    , sum-lists
+--    , Test.MinStack
+--    , Test.Queue
+--    , Test.Stack
+--    , url-encode
+--    , zero-matrix
+
+  build-depends:
+      base
+    , hspec
+    , QuickCheck
+
+  other-extensions:

src/Introduction/VI/Example01.hs

@@ -0,0 +1,14 @@
+{-|
+Module      : Introduction.VI.Example01
+Description : Introduction VI (Big O) Example 1 on Page 40
+-}
+module Introduction.VI.Example01 where
+
+import Prelude hiding (sum)
+
+sum :: Int -> Int
+sum n | n <= 0    = 0
+      | otherwise = n + sum (n - 1)
+
+main :: IO ()
+main = print $ sum 4

src/Main.hs

@@ -1,7 +1,5 @@
 module Main where
 
-import Test.Hspec
-import Test.QuickCheck
 import Ch1
 import Ch2
 import Ch3

src/chapter-1/Ch1.hs

@@ -1,10 +1,8 @@
 module Ch1 where
 
-import Test.QuickCheck
 import Test.Hspec
 
 ch1 :: IO ()
-ch1 = hspec $ do
-  describe "_______________________Chapter 1 tests_______________________" $ do
-    it "should have tests" $ do
-      True
+ch1 = hspec $
+  describe "_______________________Chapter 1 tests_______________________" $
+    it "should have tests" True

src/chapter-1/one-away.hs

@@ -3,7 +3,7 @@ oneAway a b = a `elem` candidates
   where candidates = deletes ++ transposes ++ replaces ++ inserts
         strlen = 1 + length b
         splits = zipWith splitAt [0..strlen] (replicate strlen b)
-        deletes = [x ++ (tail y) | (x, y) <- splits, length y > 0]
+        deletes = [x ++ tail y | (x, y) <- splits, not (null y)]
         transposes = [x ++ head t : head y : tail t | (x, y) <- splits, length y > 1, let t = tail y]
-        replaces = [x ++ c : (tail y) | (x, y) <- splits, c <- ['a'..'z'], length y > 0]
+        replaces = [x ++ c : tail y | (x, y) <- splits, c <- ['a'..'z'], not (null y)]
         inserts = [x ++ c : y | (x, y) <- splits, c <- ['a'..'z']]

src/chapter-1/zero-matrix.hs

@@ -4,7 +4,7 @@ zeroMatrix :: [[Integer]] -> [[Integer]]
 zeroMatrix x = [[zero i j v | (j, v) <- zip [0..] row] | (i, row) <- zip [0..] x]
   where zeroRows = zeroIndices x
         zeroCols = zeroIndices $ transpose x
-        zeroIndices y = map fst $ filter snd $ zip [0..] (map (any (== 0)) y)
+        zeroIndices y = map fst $ filter snd $ zip [0..] (map (elem 0) y)
         zero row col val | row `elem` zeroRows = 0
                          | col `elem` zeroCols = 0
                          | otherwise = val

src/chapter-2/Ch2.hs

@@ -1,11 +1,9 @@
 module Ch2 where
 
-import Test.QuickCheck
 import Test.Hspec
 
 ch2 :: IO ()
-ch2 = hspec $ do
-  describe "_______________________Chapter 2 tests_______________________" $ do
-    it "should have tests" $ do
-      True
+ch2 = hspec $
+  describe "_______________________Chapter 2 tests_______________________" $
+    it "should have tests" True
 

src/chapter-3/Ch3.hs

@@ -1,13 +1,12 @@
 module Ch3 where
 
-import Test.QuickCheck
 import Test.Hspec
 import Test.Stack
 import Test.Queue
 import Test.MinStack
 
 ch3 :: IO ()
-ch3 = hspec $ do
+ch3 = hspec $
   describe "_______________________Chapter 3 tests_______________________" $ do
     testStack
     testQueue

src/chapter-3/Data/Queue.hs

@@ -6,7 +6,7 @@ instance Eq a => Eq (Queue a) where
   (==) a b = let a' = reorder a
                  b' = reorder b
              in checkEq a' b'
-             where checkEq (Queue xs ys) (Queue xs' ys') = ys == ys'
+             where checkEq (Queue _ ys) (Queue _ ys') = ys == ys'
 
 mkQueue :: a -> Queue a
 mkQueue a = Queue [a] []
@@ -16,18 +16,18 @@ enqueue a (Queue xs ys) = Queue (a:xs) ys
 
 dequeue :: Queue a -> Queue a
 dequeue q = case reorder q of 
-  (Queue xs (y:ys)) -> Queue xs ys
-  otherwise -> reorder q
+  (Queue xs (_:ys)) -> Queue xs ys
+  _                 -> reorder q
 
 peek :: Queue a -> Maybe a
 peek a = case reorder a of
-  (Queue _ (y:ys)) -> Just y
-  otherwise        -> Nothing
+  (Queue _ (y:_)) -> Just y
+  _                -> Nothing
 
 isEmpty :: Queue a -> Bool
 isEmpty (Queue [] []) = True
 isEmpty (Queue _ _ )  = False
 
 reorder :: Queue a -> Queue a
-reorder q@(Queue xs (y:ys)) = q
 reorder (Queue xs []) = Queue [] (reverse xs)
+reorder q = q

src/chapter-3/Data/Stack.hs

@@ -1,22 +1,22 @@
 module Data.Stack where
 
-data Stack a = Stack [a]
+newtype Stack a = Stack [a]
   deriving (Eq, Show)
 
 push :: a -> Stack a -> Stack a
 push a (Stack xs) = Stack (a:xs)
 
 pop :: Stack a -> Stack a
-pop (Stack (x:xs)) = Stack xs
+pop (Stack (_:xs)) = Stack xs
 pop (Stack []) = Stack []
 
 peek :: Stack a -> Maybe a
-peek (Stack (x:xs)) = Just x
+peek (Stack (x:_)) = Just x
 peek (Stack []) = Nothing
 
 isEmpty :: Stack a -> Bool
 isEmpty (Stack []) = True
-isEmpty (Stack xs) = False
+isEmpty (Stack _)  = False
 
 mkStack :: a -> Stack a
 mkStack a = Stack [a]