How to resolve the algorithm Middle three digits step by step in the 11l programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Middle three digits step by step in the 11l 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 11l programming language
Source code in the 11l programming language
F middle_three_digits(i)
V s = String(abs(i))
assert(s.len >= 3 & s.len % 2 == 1, ‘Need odd and >= 3 digits’)
R s[s.len I/ 2 - 1 .+ 3]
V passing = [123, 12345, 1234567, 987654321, 10001, -10001, -123, -100, 100, -12345]
V failing = [1, 2, -1, -10, 2002, -2002, 0]
L(x) passing [+] failing
X.try
V answer = middle_three_digits(x)
print(‘middle_three_digits(#.) returned: #.’.format(x, answer))
X.catch AssertionError error
print(‘middle_three_digits(#.) returned error: ’.format(x)‘’String(error))
You may also check:How to resolve the algorithm Grayscale image step by step in the Maple programming language
You may also check:How to resolve the algorithm Chinese zodiac step by step in the Haskell programming language
You may also check:How to resolve the algorithm Circles of given radius through two points step by step in the F# programming language
You may also check:How to resolve the algorithm Environment variables step by step in the Tcl programming language
You may also check:How to resolve the algorithm Carmichael 3 strong pseudoprimes step by step in the C++ programming language