Location
Forge
Sharpen your GDScript on standalone challenges. New problems whenever you want them, long after the quests are done. Free to forge.
Kata of the Day
Sift the Even Runes
Walk the rune array, keep only the even numbers in a new array, then print each kept rune on its own line.
Print every number from 1 to 5, one per line.
A potion heals 12 HP and you drink 3 of them. Print the total HP healed.
For each number from 1 to 4, print "even" if it is even, otherwise "odd".
Print every number from 1 to 5, one per line, using a for loop over a range.
Set a number to 7, then print "Odd" if it is odd or "Even" if it is even using the modulo operator.
A value of -4 is carved on a blade, so print "negative", "positive", or "zero" depending on its sign.
A goblin lands two hits for 15 and 8 damage, so print the total damage dealt.
Your hero starts at 30 HP and quaffs a potion that restores 25 HP, so print the new HP total.
You collect gold drops of 5, 10, and 20. Add them up and print the total.
Count down from 5 to 1 (one per line), then print "Liftoff".
Write a function double(x) that returns x times 2, then print double(21).
Add up every number from 1 to 5 with a loop and print the total once at the end.
Multiply the numbers 1, 2, 3 and 4 together with a loop and print the product.
Print 0, 5, 10 and 15 by stepping in fives, one value per line.
Count down from 5 to 1 using a while loop, printing each number on its own line.
An apprentice scored 85, so print their letter grade where 90+ is "A", 80+ is "B", 70+ is "C", and anything lower is "F".
Given the scores [55, 90, 70, 40, 88], count how many are 60 or above and print that count.
From the list [3, 5, 9, 10, 15], count how many numbers are divisible by 3 and print that total.
Write a function that returns the sum of all whole numbers from 1 up to n, then print the result for n equal to 5.
Write a function that returns the largest value in an array, then print the strongest blade from the list of damage values.
Write a function that raises a base to a whole-number exponent by repeated multiplication, then print 2 raised to the 10th.
Sum every gold value in the chest array and print the total.
Begin with an empty pack, append four items into it, then print how many it holds.
Scan the damage array and print the single largest value.
Print the items of the pack from the last index down to the first using index access.
Four chests hold 7, 13, 25, and 5 gold, so loop over them and print the total hoard.
Chant the six times table by printing 6 multiplied by each number from 1 to 5.
For 1 to 15: print "Fizz" for multiples of 3, "Buzz" for multiples of 5, "FizzBuzz" for both, otherwise the number.
Add up only the even numbers from 1 to 10 and print the total.
For each number from 1 to 15, print "Fizz" if it is divisible by 3, "Buzz" if divisible by 5, "FizzBuzz" if divisible by both, otherwise the number itself.
Three warriors have power 4, 9, and 7, so print the largest of the three using only comparisons.
Write a function that returns the factorial of n (the product of every number from 1 to n), then print the factorial of 6.
Write a function that reports whether a number is prime using a loop, then print every prime from 2 through 20, one per line.
Count how many monster health values in the array are greater than 10 and print that count.
Find the largest and smallest value in the array, then print the difference between them.
A triangular cairn stacks 1 stone, then 2, up through 10, so print the total number of stones.
Count the portal down from 5 to 1 on separate lines, then print Liftoff once it opens.
Write factorial(n) (using a loop) and print factorial(5). It should print 120.
Write a function that returns the product of all numbers from 1 to n, then print the result for 5.
Write a square function and an add-one function, then print square(add_one(4)) followed by add_one(square(3)) to see how order changes the result.
Write a function that adds up the squares of every number from 1 to n by calling a helper square function inside a loop, then print the total for n equal to 4.
Write a function where damage starts at 3 and doubles each turn for 4 turns, printing the running total each turn and then the final total it returns.
