🔹DataWeave Challenges

Programming challenges designed to be solved using DataWeave.

The general idea is that you try to solve these challenges only with the docs and avoid googling or asking someone else how to get to the answer. This will maximize your learning because you will have to read the documentation for several functions/operators to get to an appropriate solution.

• Challenges - find here the whole list of challenges in ProstDev.

• YouTube playlist - watch the explanations on video instead of reading them.

#1: Add numbers separated by paragraphs and get the max number

Article:

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

Video:

#2: Rock Paper Scissors game score system

Article:

DataWeave programming challenge #2: Rock Paper Scissors game score system | ProstDev BlogProstDev

Video:

#3: Count palindrome phrases using the Strings module

Article:

DataWeave programming challenge #3: Count palindrome phrases using the Strings module | ProstDev BlogProstDev

Video:

#4: Solve the Tower of Hanoi mathematical puzzle

Article:

DataWeave programming challenge #4: Solve the Tower of Hanoi mathematical puzzle | ProstDev BlogProstDev

Video:

#5: Reverse a phrase's words, but keep the punctuation

Article:

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

Video:

#6: Using tail-recursion to get the factorial of a number

Article:

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

Video:

#7: Modify certain values from a JSON structure

Article:

DataWeave programming challenge #7: Modify certain values from a JSON structure | ProstDev BlogProstDev

Video:

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

Article:

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

Video: