How to resolve the algorithm Middle three digits step by step in the Wren programming language

Published on 12 May 2024 09:40 PM
#Wren

How to resolve the algorithm Middle three digits step by step in the Wren 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 Wren programming language

Source code in the wren programming language

import "/fmt" for Fmt

var middle3 = Fn.new { |n|
    if (n < 0) n = -n
    var s = "%(n)"
    var c = s.count
    if (c < 3) return "Minimum is 3 digits, only has %(c)."
    if (c%2 == 0) return "Number of digits must be odd, %(c) is even."
    if (c == 3) return s
    var d = (c - 3)/2
    return s[d..d+2]
}

var a = [123, 12345, 1234567, 987654321, 10001, -10001, -123, -100, 100, -12345,
    1, 2, -1, -10, 2002, -2002, 0]

for (e in a) {
    System.print("%(Fmt.s(9, e)) -> %(middle3.call(e))")
}

You may also check:How to resolve the algorithm Handle a signal step by step in the PL/I programming language
You may also check:How to resolve the algorithm Probabilistic choice step by step in the J programming language
You may also check:How to resolve the algorithm Shortest common supersequence step by step in the Wren programming language
You may also check:How to resolve the algorithm Tupper's self-referential formula step by step in the Fōrmulæ programming language
You may also check:How to resolve the algorithm Damm algorithm step by step in the Pascal programming language