From b75689d270c296796c5a64e74a0717b85f195db9 Mon Sep 17 00:00:00 2001 From: Wesley Kerfoot <378351+weskerfoot@users.noreply.github.com> Date: Mon, 20 Jan 2020 20:27:41 -0500 Subject: [PATCH 1/5] Update README.md --- README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index e8915a9..46536c0 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,2 @@ -This is a collection of solutions to common interview problems, written in -Python and Haskell. These are just ones that I've come across or that I've seen -as popular questions. Pull requests are much appreciated! +This is a collection of solutions to common algorithms, written in +various programming languages. From ddbea8da25ff76eb36009051f4076f38efa41029 Mon Sep 17 00:00:00 2001 From: Wesley Kerfoot <378351+weskerfoot@users.noreply.github.com> Date: Mon, 20 Jan 2020 20:29:56 -0500 Subject: [PATCH 2/5] Update README.md --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 46536c0..8843a25 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,4 @@ This is a collection of solutions to common algorithms, written in various programming languages. + +All code is written completely by me, and is placed in the public domain. From aa7503e7eac217d12cb92e7d2f21023403159823 Mon Sep 17 00:00:00 2001 From: Wesley Kerfoot <378351+weskerfoot@users.noreply.github.com> Date: Mon, 20 Jan 2020 20:30:45 -0500 Subject: [PATCH 3/5] Create LICENSE --- LICENSE | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 LICENSE diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..fdddb29 --- /dev/null +++ b/LICENSE @@ -0,0 +1,24 @@ +This is free and unencumbered software released into the public domain. + +Anyone is free to copy, modify, publish, use, compile, sell, or +distribute this software, either in source code form or as a compiled +binary, for any purpose, commercial or non-commercial, and by any +means. + +In jurisdictions that recognize copyright laws, the author or authors +of this software dedicate any and all copyright interest in the +software to the public domain. We make this dedication for the benefit +of the public at large and to the detriment of our heirs and +successors. We intend this dedication to be an overt act of +relinquishment in perpetuity of all present and future rights to this +software under copyright law. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR +OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, +ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR +OTHER DEALINGS IN THE SOFTWARE. + +For more information, please refer to From 5a1bfa3b3192df57cc06a8e7312454c4f0ffafc5 Mon Sep 17 00:00:00 2001 From: Wesley Kerfoot <378351+weskerfoot@users.noreply.github.com> Date: Mon, 27 Jan 2020 14:18:50 -0500 Subject: [PATCH 4/5] Create sorted_digits.hs --- sorted_digits.hs | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 sorted_digits.hs diff --git a/sorted_digits.hs b/sorted_digits.hs new file mode 100644 index 0000000..7b6b3df --- /dev/null +++ b/sorted_digits.hs @@ -0,0 +1,18 @@ +import Data.List + +digits :: Int -> [Int] +digits n = unfoldr nextDigit n where + nextDigit 0 = Nothing + nextDigit c = Just $ (c `mod` 10, c `div` 10) + +isSorted :: Int -> Bool +isSorted n = (all (uncurry (<=)) ds') || (all (uncurry (>=)) ds'') + where ds = digits n + ds' = zip ds (maxBound : ds) + ds'' = zip ds (minBound : ds) + +main = do + print $ isSorted 123456 + print $ isSorted 1234561 + print $ isSorted 97541 + print $ isSorted 99431 From 7f5c2eaead3ab57e358eda20e1cc50f74765c256 Mon Sep 17 00:00:00 2001 From: Wesley Kerfoot <378351+weskerfoot@users.noreply.github.com> Date: Mon, 27 Jan 2020 14:25:25 -0500 Subject: [PATCH 5/5] cleanup --- sorted_digits.hs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/sorted_digits.hs b/sorted_digits.hs index 7b6b3df..456ad52 100644 --- a/sorted_digits.hs +++ b/sorted_digits.hs @@ -3,10 +3,10 @@ import Data.List digits :: Int -> [Int] digits n = unfoldr nextDigit n where nextDigit 0 = Nothing - nextDigit c = Just $ (c `mod` 10, c `div` 10) + nextDigit c = Just (c `mod` 10, c `div` 10) isSorted :: Int -> Bool -isSorted n = (all (uncurry (<=)) ds') || (all (uncurry (>=)) ds'') +isSorted n = all (uncurry (<=)) ds' || all (uncurry (>=)) ds'' where ds = digits n ds' = zip ds (maxBound : ds) ds'' = zip ds (minBound : ds)