In this post I show you how to solve the Free Code Camp Boo Who Algorithm. It is actually probably one of the easiest problems out there, but it can trip you up if you don’t do your research. A bit of Googling and reading up, and you’ll knock this one over in no time. Let’s begin!
It’s been just over 12 months since I started my Free Code Camp Front End Certificate. In those past twelve months I have taken on a lot of new information and have thoroughly enjoyed learning to code. Now that I have recently finished the Front End Certificate, I thought it would be a good time to reflect and share some insights. (more…)
In this post I will describe the method I used to solve the Free Code Camp Pig Latin Algorithm challenge. This was quite a challenging problem for me as it involved quite a few moving parts. However, it was really worth the pain because it taught me a lot about string manipulation, which is quite a common task in day-to-day web development work. (more…)
I don’t know about you, but after the last bonfire challenge this one was almost too easy. In this post I will show you how to write a simple search & replace algorithm. You could almost write this in literal pseudo code and get it to work!
In this post I’m going to explain how to unravel the tricky algorithm challenge called Wherefore Art Thou. At first, it seems really overwhelming with all that data being thrown at you. But with the help of the new ES 6 Array helper methods like filter and every things truly do become much clearer. It is really worth putting in some time to learn about ES6 and what it can do for you. But without further ado, lets get started!
This Roman Numerals Converter challenge is a great way to show you how to manipulate elements based on a particular number/value algorithm. In this post I show you how to solve this bonfire using the new ES6 map method. (more…)
Alright, now that I have completed the first round of Front End projects, finally we are back into scripting! In this post I’ll show you how to solve the first intermediate bonfire problem where you need to sum all numbers in a range. For example, if your range is [1 – 5], you’ll need to add 1+2+3+4+5 together.