The examples shown here are intended to be clear, sensible implementations rather than deliberately code-golfed solutions. If you can make one shorter, clearer, more idiomatic, or otherwise better, submit your version for review.

If accepted, your solution may replace the current example and your name will be shown alongside it.

Your submission must

• Solve the same problem as the existing example.
• Accept the same kind of variable input rather than being hard-coded for the example values shown.
• Produce the correct result for valid inputs.
• Preserve the behaviour and input/output requirements of the existing example.
• Be valid, runnable code in the selected language rather than pseudocode.
• Not contain a pre-generated or hard-coded answer.
• Not use external libraries, packages, services, or APIs to perform the task.
• Not use a built-in function that directly solves the whole problem.

Standard-library features are allowed. For example, using normal collection types, loops, ranges, sums, iterators, and other general-purpose language features is fine.

What counts as an improvement?

Fewer lines or characters can make a solution interesting, but this is not purely a code-golf competition. We will also consider:

• clarity;
• readability;
• idiomatic use of the language;
• elegance;
• and whether the submission offers a genuinely better approach.

The shortest submission will not automatically replace the current example. Dyalog will review submissions and decide which version is most appropriate to display.

Counting code

The line and character counts refer only to the code displayed in the comparison. Standard-library imports, #include directives, and unrelated class or program boilerplate are omitted and are not included in the count.

Whitespace used to format the displayed solution may be included in the character count, so the figures should be treated as a useful comparison rather than an absolute measure of which language is most concise.