In this post I will describe the method I used to solve the Free Code Camp DNA Pairing Algorithm challenge. It’s a great exercise to build up your of Array strength! I’m going to show how I solved this challenge using two different methods.
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!
In this Free Code Camp bonfire I’ll show you how to truncate a string, a useful piece of code which can be used whenever you want to create an excerpt that says read more…
Repeat a string (first argument) n times (second argument). Return an empty string if n is a negative number. This is a super simple problem involving an if else statement. There’s not much to it, so let’s dive in and take a look.