DataWeave programming challenge #8: Sum all digits to get a 1-digit number

---

Other posts from this series:

1. DataWeave programming challenge #1: Add numbers separated by paragraphs and get the max number

2. DataWeave programming challenge #2: Rock Paper Scissors game score system

3. DataWeave programming challenge #3: Count palindrome phrases using the Strings module

4. DataWeave programming challenge #4: Solve the Tower of Hanoi mathematical puzzle

5. DataWeave programming challenge #5: Reverse a phrase's words, but keep the punctuation

6. DataWeave programming challenge #6: Using tail-recursion to get the factorial of a number

7. DataWeave programming challenge #7: Modify certain values from a JSON structure

8. DataWeave programming challenge #8: Sum all digits to get a 1-digit number

---

In this post:

• Input

• Explanation of the problem

• Expected output

• Clues

• Answer

---

Try to solve this challenge on your own to maximize learning. We recommend you refer to the DataWeave documentation only. Try to avoid using Google or asking others so you can learn on your own and become a DataWeave expert!

Solve on the Playground

Input

Consider the following input payload (can be of txt format):

2456
2
25235
2456
6
54
58795
3
456
76544
0

Explanation of the problem

Create a DataWeave script to sum all the digits from the input payload until there's only one digit left.

For example,

• 123 + 456 = 579

• 579 is broken down into 5 + 7 + 9 = 21

• 21 is broken down into 2 + 1 = 3

• The final result is 3 because it's a 1-digit number

Expected output

In this case, the expected output would be:

2

Clues

If you're stuck with your solution, feel free to check out some of these clues to give you ideas on how to solve it!

Clue #1

Clue #2

Clue #3

Answer

If you haven't solved this challenge yet, we encourage you to keep trying! It's ok if it's taking longer than you thought. We all have to start somewhere ✨ Check out the clues and read the docs before giving up. You got this!! 💙

There are many ways to solve this challenge, but you can find some solutions we provide here so you can compare your result with us.

Solution #1

Solution #2

Feel free to comment your code below for others to see! 😄

Subscribe to receive notifications as soon as new content is published ✨

Previous Challenge

Next Challenge (Not Available Yet)