Category: Free Code Camp

Front End Insights: The unofficial guide to writing better front end code

jackLyons Free Code Camp, Web Development Tags:
0
Front End Enlightenment

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…)

Search and Replace FCC Algorithm Challenge

jackLyons Free Code Camp
0

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!

(more…)

Wherefore Art Thou: FCC Algorithm Scripting

jackLyons Free Code Camp Tags: ,
2

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!

(more…)

Free Code Camp Intermediate Scripting: Diff Two Arrays

jackLyons Free Code Camp Tags:
0

This seemingly simple Free Code Camp intermediate algorithm problem requires a bit of deeper thinking and understanding of functions, however it’s all there in the MDN JavaScript documentation. The question asks us to “Compare two arrays and return a new array with any items only found in one of the two given arrays, but not both. In other words, return the symmetric difference of the two arrays.

(more…)

Free Code Camp Bonfire: Sum All Numbers in a Range

jackLyons Free Code Camp Tags:
0

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.

(more…)

Sign up to receive up-to-date web tips, tricks and code hacks!