How to resolve the algorithm Middle three digits step by step in the Clojure programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Middle three digits step by step in the Clojure programming language
Table of Contents
Problem Statement
Write a function/procedure/subroutine that is called with an integer value and returns the middle three digits of the integer if possible or a clear indication of an error if this is not possible. Note: The order of the middle digits should be preserved. Your function should be tested with the following values; the first line should return valid answers, those of the second line should return clear indications of an error: Show your output on this page.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Middle three digits step by step in the Clojure programming language
Source code in the clojure programming language
(defn middle3
[v]
(let [digit-str (str (Math/abs v))
len (count digit-str)]
(cond
(< len 3) :too-short
(even? len) :even-digit-count
:else (let [half (/ len 2)]
(subs digit-str (- half 1) (+ half 2))))))
(clojure.pprint/print-table
(for [i [123 12345 1234567 987654321 10001 -10001 -123 -100 100 -12345
1 2 -1 -10 2002 -2002 0]]
{:i i :middle-3 (middle3 i)}))
You may also check:How to resolve the algorithm Emirp primes step by step in the REXX programming language
You may also check:How to resolve the algorithm Knapsack problem/Bounded step by step in the MiniZinc programming language
You may also check:How to resolve the algorithm Range extraction step by step in the Mercury programming language
You may also check:How to resolve the algorithm Introspection step by step in the UNIX Shell programming language
You may also check:How to resolve the algorithm A+B step by step in the Lang programming language