{"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":"ff0d7fb0ab6c424abd8942582bb3cd8f","snippet":"(defpackage :hello-world\n  (:use :cl)\n  (:export :hello))\n\n(in-package :hello-world)\n\n(defun hello () \"Hello, World!\")\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1669,"num_iterations":1,"num_loc":0,"iteration_status":"celebratory_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T03:45:45.000Z","is_out_of_date":false,"language":"lisp","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.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/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/common-lisp/exercises/hello-world/iterations"}},{"uuid":"160af05e96064a178ee5ae633d074509","snippet":"class HelloWorld\n  def self.hello\n    \"Hello, World!\"\n  end\nend\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":12198,"num_iterations":1,"num_loc":0,"iteration_status":"celebratory_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T04:19:34.000Z","is_out_of_date":false,"language":"ruby","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.svg"},"track":{"title":"Ruby","icon_url":"https://assets.exercism.org/tracks/ruby.svg","highlightjs_language":"ruby"},"links":{"public_url":"https://exercism.org/tracks/ruby/exercises/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/ruby/exercises/hello-world/iterations"}},{"uuid":"9389b84252cd419f9698bd14a4387ce3","snippet":"END {\n    name = NF ? $0 : \"you\"\n    print \"One for \" name \", one for me.\"\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-14T17:21:51.000Z","is_out_of_date":false,"language":"awk","author":{"handle":"Andriamanitra"},"exercise":{"title":"Two Fer","icon_url":"https://assets.exercism.org/exercises/two-fer.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/two-fer/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/awk/exercises/two-fer/iterations"}},{"uuid":"f453a09428bf41378255bbaae99b3a1f","snippet":"proc twoFer*(you: string = \"you\"): string =\n  return fmt\"One for {you}, one for me.\"\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":"2021-09-02T05:42:48.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Andriamanitra"},"exercise":{"title":"Two Fer","icon_url":"https://assets.exercism.org/exercises/two-fer.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/tracks/nim/exercises/two-fer/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/nim/exercises/two-fer/iterations"}},{"uuid":"4329cc3028a1459a884ba896ceb973f8","snippet":"proc isLeapYear*(year: int): bool =\n  if year mod 400 == 0:\n    return true\n  elif year mod 100 == 0:\n    return false\n  else:\n    return year mod 4 == 0\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":"2021-09-02T05:46:50.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Andriamanitra"},"exercise":{"title":"Leap","icon_url":"https://assets.exercism.org/exercises/leap.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/tracks/nim/exercises/leap/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/nim/exercises/leap/iterations"}},{"uuid":"946b25c40dbc4c678f521c42dc0aa8cb","snippet":"(define (divisible-by? n m)\n    (= (remainder n m) 0))\n\n(define (leap-year? year)\n    (and\n        (divisible-by? year 4)\n        (or\n            (not (divisible-by? year 100))\n            (divisible-by? year 400))))","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T03:11:06.000Z","is_out_of_date":false,"language":"scheme","author":{"handle":"Andriamanitra"},"exercise":{"title":"Leap","icon_url":"https://assets.exercism.org/exercises/leap.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/leap/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/racket/exercises/leap/iterations"}},{"uuid":"33f6a8546259430f958ad71667742184","snippet":"module ReverseString (reverseString) where\n\nreverseString :: String -\u003e String\nreverseString = reverse\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":254,"num_iterations":1,"num_loc":3,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-03T04:11:44.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Andriamanitra"},"exercise":{"title":"Reverse String","icon_url":"https://assets.exercism.org/exercises/reverse-string.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/reverse-string/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/haskell/exercises/reverse-string/iterations"}},{"uuid":"d6d85ceff3a144f5909a39f6ab009a2d","snippet":"(module\n  (func (export \"score\") (param $x f32) (param $y f32) (result i32)\n    (local $dist f32)\n    (f32.mul (local.get $x) (local.get $x))\n    (f32.mul (local.get $y) (local.get $y))\n    f32.add\n    f32.sqrt\n    local.set $dist\n    (if (f32.le (local.get $dist) (f32.const 1.0))\n      (then\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":8,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-24T16:10:37.000Z","is_out_of_date":false,"language":"wasm","author":{"handle":"Andriamanitra"},"exercise":{"title":"Darts","icon_url":"https://assets.exercism.org/exercises/darts.svg"},"track":{"title":"WebAssembly","icon_url":"https://assets.exercism.org/tracks/wasm.svg","highlightjs_language":"wasm"},"links":{"public_url":"https://exercism.org/tracks/wasm/exercises/darts/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/wasm/exercises/darts/iterations"}},{"uuid":"3ea6e5eb3e404c74bb73d17516e789d0","snippet":"// \u0026'static is a \"lifetime specifier\", something you'll learn more about later\npub fn hello() -\u003e \u0026'static str {\n    \"Hello, World!\"\n}\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":35226,"num_iterations":1,"num_loc":0,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-02T04:53:57.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/tracks/rust/exercises/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/rust/exercises/hello-world/iterations"}},{"uuid":"2fef0b91b9f545ff851c0b0d5b9724a3","snippet":"(ns leap)\n\n(defn divisible-by? [x y]\n  (= 0 (mod x y)))\n\n(defn leap-year? [year]\n  (and (divisible-by? year 4)\n       (or (divisible-by? year 400) (not (divisible-by? year 100)))))\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":"2024-01-24T00:28:59.000Z","is_out_of_date":false,"language":"clojure","author":{"handle":"Andriamanitra"},"exercise":{"title":"Leap","icon_url":"https://assets.exercism.org/exercises/leap.svg"},"track":{"title":"Clojure","icon_url":"https://assets.exercism.org/tracks/clojure.svg","highlightjs_language":"clojure"},"links":{"public_url":"https://exercism.org/tracks/clojure/exercises/leap/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/clojure/exercises/leap/iterations"}},{"uuid":"f0f658e152eb48b78581448d3c865714","snippet":"(define (hamming-distance dna-a dna-b)\n    (unless (= (string-length dna-a) (string-length dna-b))\n        (error \"different lengths!\"))\n    (for/sum ([x (in-string dna-a)] [y (in-string dna-b)])\n        (if (char=? x y) 0 1)))\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-13T00:53:23.000Z","is_out_of_date":false,"language":"scheme","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hamming","icon_url":"https://assets.exercism.org/exercises/hamming.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/hamming/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/racket/exercises/hamming/iterations"}},{"uuid":"73edcbee4a864566999a3dd5f8c23aad","snippet":"module HelloWorld\n\nlet hello = \"Hello, World!\"","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1248,"num_iterations":1,"num_loc":2,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-18T08:37:35.000Z","is_out_of_date":true,"language":"fsharp","author":{"handle":"Andriamanitra"},"exercise":{"title":"Hello World","icon_url":"https://assets.exercism.org/exercises/hello-world.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/hello-world/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/fsharp/exercises/hello-world/iterations"}},{"uuid":"7bfc03423f354de3adec451a1390f1c3","snippet":"module AnnalynsInfiltration\n\nlet canFastAttack (knightIsAwake: bool): bool = not knightIsAwake\n\nlet canSpy (knightIsAwake: bool) (archerIsAwake: bool) (prisonerIsAwake: bool): bool =\n    knightIsAwake || archerIsAwake || prisonerIsAwake\n\nlet canSignalPrisoner (archerIsAwake: bool) (prisonerIsAwake: bool): bool =\n    prisonerIsAwake \u0026\u0026 not archerIsAwake\n\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-18T08:56:20.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Andriamanitra"},"exercise":{"title":"Annalyn's Infiltration","icon_url":"https://assets.exercism.org/exercises/annalyns-infiltration.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/annalyns-infiltration/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/fsharp/exercises/annalyns-infiltration/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":"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":"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":"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":"c108428674564833ab5b700a45104d4b","snippet":"(define (collatz n)\n    (cond\n        [(not (exact-positive-integer? n)) (raise (error \"invalid n\"))]\n        [(= n 1) 0]\n        [(even? n) (add1 (collatz (/ n 2)))]\n        [(odd? n)  (add1 (collatz (add1 (* 3 n))))]))\n\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-13T00:34:42.000Z","is_out_of_date":false,"language":"scheme","author":{"handle":"Andriamanitra"},"exercise":{"title":"Collatz Conjecture","icon_url":"https://assets.exercism.org/exercises/collatz-conjecture.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/collatz-conjecture/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/racket/exercises/collatz-conjecture/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":"4f5c5fac1b6b44238226c61d4afd1454","snippet":"class CustomSet:\n    FILL_FACTOR = 1.0\n    GROWTH_FACTOR = 2\n    NUM_INITIAL_BUCKETS = 16\n\n    def __init__(self, elements=[]):\n        self.n_buckets = self.NUM_INITIAL_BUCKETS\n        self.size = 0\n        self.buckets = [[] for _ in range(self.n_buckets)]\n        for el in elements:\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":48,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-01T04:29:15.000Z","is_out_of_date":false,"language":"python","author":{"handle":"Andriamanitra"},"exercise":{"title":"Custom Set","icon_url":"https://assets.exercism.org/exercises/custom-set.svg"},"track":{"title":"Python","icon_url":"https://assets.exercism.org/tracks/python.svg","highlightjs_language":"python"},"links":{"public_url":"https://exercism.org/tracks/python/exercises/custom-set/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/python/exercises/custom-set/iterations"}},{"uuid":"0a4b4ca9f71a40bea68a904e3544207e","snippet":"class Anagram\n  def self.find(word, candidates)\n    t = word.downcase.chars.tally\n    candidates.reject{|w|w.downcase == word.downcase}.select{|w| w.downcase.chars.tally == t}\n  end\nend","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"non_actionable_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-18T19:56:35.000Z","is_out_of_date":false,"language":"crystal","author":{"handle":"Andriamanitra"},"exercise":{"title":"Anagram","icon_url":"https://assets.exercism.org/exercises/anagram.svg"},"track":{"title":"Crystal","icon_url":"https://assets.exercism.org/tracks/crystal.svg","highlightjs_language":"crystal"},"links":{"public_url":"https://exercism.org/tracks/crystal/exercises/anagram/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/crystal/exercises/anagram/iterations"}},{"uuid":"cac1b55687cc4eed874270e24921b894","snippet":"module ProteinTranslation\n  CODONS = {\n    \"AUG\" =\u003e \"Methionine\",\n    \"UUU\" =\u003e \"Phenylalanine\",\n    \"UUC\" =\u003e \"Phenylalanine\",\n    \"UUA\" =\u003e \"Leucine\",\n    \"UUG\" =\u003e \"Leucine\",\n    \"UCU\" =\u003e \"Serine\",\n    \"UCC\" =\u003e \"Serine\",\n    \"UCA\" =\u003e \"Serine\",\n","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-03T12:49:52.000Z","is_out_of_date":false,"language":"crystal","author":{"handle":"Andriamanitra"},"exercise":{"title":"Protein Translation","icon_url":"https://assets.exercism.org/exercises/protein-translation.svg"},"track":{"title":"Crystal","icon_url":"https://assets.exercism.org/tracks/crystal.svg","highlightjs_language":"crystal"},"links":{"public_url":"https://exercism.org/tracks/crystal/exercises/protein-translation/solutions/Andriamanitra","private_iterations_url":"https://exercism.org/tracks/crystal/exercises/protein-translation/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"}}],"meta":{"current_page":1,"total_count":85,"total_pages":4,"unscoped_total":85}}