{"results":[{"uuid":"dc623cd45ad74035b420de2dad07638f","snippet":"{\n    if ($1 in resistance \u0026\u0026 $2 in resistance) {\n        print 10 * resistance[$1] + resistance[$2]\n    } else {\n        print \"invalid color\"\n        exit 1\n    }\n}\n\nBEGIN {\n","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:59:24.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"Resistor Color Duo","icon_url":"https://assets.exercism.org/exercises/resistor-color-duo.svg"},"track":{"title":"AWK","icon_url":"https://assets.exercism.org/tracks/awk.svg","highlightjs_language":"awk"},"links":{"public_url":"https://exercism.org/tracks/awk/exercises/resistor-color-duo/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/resistor-color-duo/iterations"}},{"uuid":"cd6c125a302943cd8f7ca6730119df22","snippet":"module Raindrops (convert) where\n\nimport Data.Maybe\n\ndivisibleBy :: Int -\u003e Int -\u003e Bool\ndivisibleBy d n = mod n d == 0\n\nwhen :: a -\u003e (b -\u003e Bool) -\u003e b -\u003e Maybe a\nwhen sound f n =\n  if f n then Just sound else Nothing\n","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-31T00:16:07.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Raindrops","icon_url":"https://assets.exercism.org/exercises/raindrops.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/raindrops/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/raindrops/iterations"}},{"uuid":"2c2c7568ca7d4cb79440bdcf43a4d92f","snippet":"const ROMANS = begin\n    ONES      = [\"\", \"I\", \"II\", \"III\", \"IV\", \"V\", \"VI\", \"VII\", \"VIII\", \"IX\"]\n    TENS      = replace.(ONES, \"I\" =\u003e \"X\", \"V\" =\u003e \"L\", \"X\" =\u003e \"C\")\n    HUNDREDS  = replace.(ONES, \"I\" =\u003e \"C\", \"V\" =\u003e \"D\", \"X\" =\u003e \"M\")\n    THOUSANDS = [\"\", \"M\", \"MM\", \"MMM\"]\n    [ONES; TENS; HUNDREDS; THOUSANDS]\nend\n\nfunction to_roman(number)\n    number ∈ 1:3999 || error(\"$number is not representable as roman numeral\")\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-06T08:08:53.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"Andriamanitra"},"exercise":{"title":"Roman Numerals","icon_url":"https://assets.exercism.org/exercises/roman-numerals.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/tracks/julia/exercises/roman-numerals/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/julia/exercises/roman-numerals/iterations"}},{"uuid":"a7342b42cfc34b4f9bc8348422f93be1","snippet":"LETTER_VALUES = [(\"AEIOULNRST\", 1), (\"DG\", 2), (\"BCMP\", 3), (\"FHVWY\", 4), (\"K\", 5), (\"JX\", 8), (\"QZ\", 10)]\nSCORE_DICT = Dict(c =\u003e v for (letters, v) in LETTER_VALUES for c in letters)\n\nscore(letter::Char) = get(SCORE_DICT, uppercase(letter), 0)\nscore(str::String) = sum(score, collect(str); init=0)\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-03T03:04:02.000Z","is_out_of_date":false,"language":"julia","author":{"handle":"Andriamanitra"},"exercise":{"title":"Scrabble Score","icon_url":"https://assets.exercism.org/exercises/scrabble-score.svg"},"track":{"title":"Julia","icon_url":"https://assets.exercism.org/tracks/julia.svg","highlightjs_language":"julia"},"links":{"public_url":"https://exercism.org/tracks/julia/exercises/scrabble-score/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/julia/exercises/scrabble-score/iterations"}},{"uuid":"c929dc55396545e386677d8faf09cecc","snippet":"module hello_world\ncontains\n  function hello()\n    character(13) :: hello\n    hello = \"Hello, World!\"\n\n  end function hello\n\nend module hello_world\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":19,"num_iterations":1,"num_loc":0,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T05:05:13.000Z","is_out_of_date":false,"language":"fortran","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.svg"},"track":{"title":"Fortran","icon_url":"https://assets.exercism.org/tracks/fortran.svg","highlightjs_language":"fortran"},"links":{"public_url":"https://exercism.org/tracks/fortran/exercises/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/fortran/exercises/hello-world/iterations"}},{"uuid":"907f00e3703a46c992ca615b18697793","snippet":"module armstrong_numbers;\n\nimport std.conv;\nimport std.math;\n\nbool isArmstrongNumber(int x) {\n    auto numberOfDigits = x.to!string.length;\n    auto y = x;\n    auto total = 0;\n    while (y \u003e 0) {\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T04:30:51.000Z","is_out_of_date":false,"language":"d","author":{"handle":"Andriamanitra"},"exercise":{"title":"Armstrong Numbers","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/tracks/d/exercises/armstrong-numbers/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/d/exercises/armstrong-numbers/iterations"}},{"uuid":"5d78c5064d7747b586aec5fa7937475c","snippet":"module hello_world;\n\nstring hello() {\n    return \"Goodbye, Mars!\";\n}\n\nunittest {\n    assert(hello() == \"Goodbye, Mars!\");\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T04:25:02.000Z","is_out_of_date":false,"language":"d","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/tracks/d/exercises/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/d/exercises/hello-world/iterations"}},{"uuid":"4e91349cac8346718a35d323abc1f5d2","snippet":"(define (two-fer [name \"you\"])\n    (string-append \"One for \" name \", one for me.\"))\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":107,"num_iterations":2,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T03:00:53.000Z","is_out_of_date":false,"language":"scheme","author":{"handle":"Andriamanitra"},"exercise":{"title":"Two Fer","icon_url":"https://assets.exercism.org/exercises/two-fer.svg"},"track":{"title":"Racket","icon_url":"https://assets.exercism.org/tracks/racket.svg","highlightjs_language":"scheme"},"links":{"public_url":"https://exercism.org/tracks/racket/exercises/two-fer/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/racket/exercises/two-fer/iterations"}},{"uuid":"d3c713f7b9b0471b8d5ef5db87d91514","snippet":"(define (add-gigasecond dt)\n    (seconds-\u003edate (+ (date-\u003eseconds dt) 1000000000)))\n\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T07:14:54.000Z","is_out_of_date":false,"language":"scheme","author":{"handle":"Andriamanitra"},"exercise":{"title":"Gigasecond","icon_url":"https://assets.exercism.org/exercises/gigasecond.svg"},"track":{"title":"Racket","icon_url":"https://assets.exercism.org/tracks/racket.svg","highlightjs_language":"scheme"},"links":{"public_url":"https://exercism.org/tracks/racket/exercises/gigasecond/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/racket/exercises/gigasecond/iterations"}},{"uuid":"4f7a5f8c6640486cbab2d607a144afd1","snippet":"module Bob\n\nlet response (input: string): string =\n    let trimmed = input.Trim()\n    let yelling =\n        not (input.ToLower() = input) \u0026\u0026 input.ToUpper() = input\n    let question = trimmed.EndsWith('?')\n\n    if yelling \u0026\u0026 question then\n        \"Calm down, I know what I'm doing!\"\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-19T12:00:55.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Andriamanitra"},"exercise":{"title":"Bob","icon_url":"https://assets.exercism.org/exercises/bob.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/tracks/fsharp/exercises/bob/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/fsharp/exercises/bob/iterations"}},{"uuid":"2f807fefc0ee47b8b381b69019f548e3","snippet":"(defpackage :pal-picker\n  (:use :cl)\n  (:export :pal-picker :habitat-fitter :feeding-time-p\n           :pet :play-fetch))\n\n(in-package :pal-picker)\n\n(defun pal-picker (personality)\n  (case personality\n    (:lazy \"Cat\")\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":94,"num_iterations":1,"num_loc":28,"iteration_status":"celebratory_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-30T19:22:50.000Z","is_out_of_date":false,"language":"lisp","author":{"handle":"Andriamanitra"},"exercise":{"title":"Pal Picker","icon_url":"https://assets.exercism.org/exercises/pal-picker.svg"},"track":{"title":"Common Lisp","icon_url":"https://assets.exercism.org/tracks/common-lisp.svg","highlightjs_language":"lisp"},"links":{"public_url":"https://exercism.org/tracks/common-lisp/exercises/pal-picker/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/common-lisp/exercises/pal-picker/iterations"}},{"uuid":"35c4d5d973b940a99e7e9acd6ccb8c38","snippet":"BEGIN {\n    out = \"\"\n}\n{\n    for (i = 1; i \u003c= length($0); i++) {\n        c = substr($0, i, 1)\n        if (c == \"G\") out = out \"C\"\n        else if (c == \"C\") out = out \"G\"\n        else if (c == \"A\") out = out \"U\"\n        else if (c == \"T\") out = out \"A\"\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:41:18.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"RNA Transcription","icon_url":"https://assets.exercism.org/exercises/rna-transcription.svg"},"track":{"title":"AWK","icon_url":"https://assets.exercism.org/tracks/awk.svg","highlightjs_language":"awk"},"links":{"public_url":"https://exercism.org/tracks/awk/exercises/rna-transcription/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/rna-transcription/iterations"}},{"uuid":"7b4a4654b32e40a7aaebba9d136f1313","snippet":"NF {\n    for (i = length($0); i \u003e 0; i--) printf substr($0, i, 1)\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":3,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:29:52.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"Reverse String","icon_url":"https://assets.exercism.org/exercises/reverse-string.svg"},"track":{"title":"AWK","icon_url":"https://assets.exercism.org/tracks/awk.svg","highlightjs_language":"awk"},"links":{"public_url":"https://exercism.org/tracks/awk/exercises/reverse-string/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/reverse-string/iterations"}},{"uuid":"6d57868683db4a1db0e8f53ec6aecd28","snippet":"BEGIN {\n    if (num % 3 == 0) printf \"Pling\"\n    if (num % 5 == 0) printf \"Plang\"\n    if (num % 7 == 0) printf \"Plong\"\n    if (num % 3 \u003e 0 \u0026\u0026 num % 5 \u003e 0 \u0026\u0026 num % 7 \u003e 0) print num\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:34:10.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"Raindrops","icon_url":"https://assets.exercism.org/exercises/raindrops.svg"},"track":{"title":"AWK","icon_url":"https://assets.exercism.org/tracks/awk.svg","highlightjs_language":"awk"},"links":{"public_url":"https://exercism.org/tracks/awk/exercises/raindrops/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/raindrops/iterations"}},{"uuid":"e306aeaaecc748cb9b4661b6f9dfeccf","snippet":"{\n    print ($1 % 4 == 0 \u0026\u0026 ($1 % 400 == 0 || $1 % 100 != 0)) ? \"true\" : \"false\"\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":3,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:45:37.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"Leap","icon_url":"https://assets.exercism.org/exercises/leap.svg"},"track":{"title":"AWK","icon_url":"https://assets.exercism.org/tracks/awk.svg","highlightjs_language":"awk"},"links":{"public_url":"https://exercism.org/tracks/awk/exercises/leap/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/leap/iterations"}},{"uuid":"aafd48f1173c4d50b615a873a7863707","snippet":"proc two-fer {{name \"you\"}} {\n    return \"One for $name, one for me.\"\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":129,"num_iterations":2,"num_loc":3,"iteration_status":"celebratory_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T04:38:39.000Z","is_out_of_date":false,"language":"tcl","author":{"handle":"Andriamanitra"},"exercise":{"title":"Two Fer","icon_url":"https://assets.exercism.org/exercises/two-fer.svg"},"track":{"title":"Tcl","icon_url":"https://assets.exercism.org/tracks/tcl.svg","highlightjs_language":"tcl"},"links":{"public_url":"https://exercism.org/tracks/tcl/exercises/two-fer/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/tcl/exercises/two-fer/iterations"}},{"uuid":"f03a74aef85f4931810191ed1ea07872","snippet":"module Roman (numerals) where\n\nimport Data.Maybe (fromMaybe, listToMaybe)\n\nromans = [ (\"M\", 1000), (\"CM\", 900)\n         , (\"D\", 500),  (\"CD\", 400)\n         , (\"C\", 100),  (\"XC\", 90)\n         , (\"L\", 50),   (\"XL\", 40)\n         , (\"X\", 10),   (\"IX\", 9)\n         , (\"V\", 5),    (\"IV\", 4)\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2024-02-02T06:13:45.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Roman Numerals","icon_url":"https://assets.exercism.org/exercises/roman-numerals.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/roman-numerals/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/roman-numerals/iterations"}},{"uuid":"fa6e57763717482da54ee7a96f5e4ef9","snippet":"module Atbash (decode, encode) where\n\nimport Data.Char\nimport Data.List.Split (chunksOf)\n\nencodeChar :: Char -\u003e Char\nencodeChar c\n  | isLetter c = chr $ ord 'a' + ord 'z' - ord (toLower c)\n  | otherwise = c\n\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-01T05:16:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Atbash Cipher","icon_url":"https://assets.exercism.org/exercises/atbash-cipher.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/atbash-cipher/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/atbash-cipher/iterations"}},{"uuid":"528d9bfb7d3c4ddd8de6c38da8f81764","snippet":"module ETL (transform) where\n\nimport Data.Map (Map)\nimport Data.Map (fromList, toList)\nimport Data.Char (toLower)\n\ntransform :: Map a String -\u003e Map Char a\ntransform legacyData =\n  fromList [(toLower c, k) | (k, letters) \u003c- toList legacyData, c \u003c- letters]\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-02T02:53:49.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"ETL","icon_url":"https://assets.exercism.org/exercises/etl.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/etl/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/etl/iterations"}},{"uuid":"860a0b5848ab443f94e89ee77ae1d7dc","snippet":"module WordCount (wordCount) where\n\nimport Data.Char\nimport Data.Map (toList, fromListWith)\nimport Data.List (dropWhileEnd)\n\nisSepChar c = isPunctuation c || isSpace c\nisWordChar c = isAlphaNum c || c == '\\''\n\nsplitWords :: String -\u003e [String]\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-02T03:14:29.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Word Count","icon_url":"https://assets.exercism.org/exercises/word-count.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/word-count/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/word-count/iterations"}},{"uuid":"41f24083579340db8c2c0e2187516bee","snippet":"module Acronym (abbreviate) where\n\nimport Data.List.Split\nimport Data.Char\n\nabbreviate = foldMap f . zipPrev . filter isNotGarbage\n  where\n    f (curr, prev)\n      | isUpper curr \u0026\u0026 isLower prev = [curr]\n      | isLetter curr \u0026\u0026 (not . isLetter) prev = [toUpper curr]\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-05-15T15:25:53.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Acronym","icon_url":"https://assets.exercism.org/exercises/acronym.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/acronym/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/acronym/iterations"}},{"uuid":"5dfc857eccdf46eb8aef54a121b6f8e6","snippet":"module CollatzConjecture (collatz) where\n\ncollatz :: Integer -\u003e Maybe Integer\ncollatz n\n  | n \u003e 1      = (+1) \u003c$\u003e collatz next\n  | n == 1     = Just 0\n  | otherwise  = Nothing\n  where next = if odd n then 3 * n + 1 else div n 2\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-03T03:43:48.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Collatz Conjecture","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/collatz-conjecture/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/collatz-conjecture/iterations"}},{"uuid":"a24f55e4dfc64ef2af6274218a21475e","snippet":"module SpaceAge (Planet(..), ageOn) where\n\ndata Planet = Mercury\n            | Venus\n            | Earth\n            | Mars\n            | Jupiter\n            | Saturn\n            | Uranus\n            | Neptune\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":12,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T05:17:20.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Space Age","icon_url":"https://assets.exercism.org/exercises/space-age.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/space-age/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/space-age/iterations"}},{"uuid":"dec9c27f2b0446c7bbad62a799cec45a","snippet":"module LeapYear (isLeapYear) where\n\nisLeapYear :: Integer -\u003e Bool\nisLeapYear year\n  | mod year 400 == 0 = True\n  | mod year 100 == 0 = False\n  | mod year   4 == 0 = True\n  | otherwise = False\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":197,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T05:08:33.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Leap","icon_url":"https://assets.exercism.org/exercises/leap.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/tracks/haskell/exercises/leap/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/leap/iterations"}}],"meta":{"current_page":1,"total_count":85,"total_pages":4,"unscoped_total":85}}