Tag Archives: Bonfire

Bonfire 03: Reverse a String

Free Code Camp Bonefire challenges were the main reasons why I set up Coded Malarkey, as a way to make sure I truly and thoroughly understand the code I type. It thus only makes sense to start blogging with those! I’m now nearly at the end of the Basic Algorithm Scripting section, but I would […]


Bonfire 04: Factorialize a Number

TASK: Return the factorial of the provided integer. A recursive function is a function that calls itself until it doesn’t. In this case, it multiplies num * (num-1) until (num-1) = 0, when it multiplies the number obtained so far by 1. Resources: unicodegirl: Example of Recursion Quora: What is the best way to explain […]


Bonfire: Factorialize a Number Difficulty: Level 1

I had to redo this one. It showed up correctly the first time, but apparently my answer was so far out in left field, that I got a false positive! Instructions: Return the factorial of the provided integer. If the integer is represented with the letter n, a factorial is the product of all positive […]


Bonfire 06: Find the Longest Word in a String

TASK: Return the length of the longest word in the provided sentence.


Bonfire 08: Return Largest Numbers in Arrays

TASK: Return an array consisting of the largest number from each provided sub-array. For simplicity, the provided array will contain exactly 4 sub-arrays.


Bonfire 20: Diff Two Arrays

TASK: Compare two arrays and return a new array with any items not found in both of the original arrays.